Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/12911Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Basavaraju, M. | |
| dc.contributor.author | Chandran, L.S. | |
| dc.contributor.author | Golumbic, M.C. | |
| dc.contributor.author | Mathew, R. | |
| dc.contributor.author | Rajendraprasad, D. | |
| dc.date.accessioned | 2020-03-31T08:42:25Z | - |
| dc.date.available | 2020-03-31T08:42:25Z | - |
| dc.date.issued | 2016 | |
| dc.identifier.citation | Algorithmica, 2016, Vol.75, 1, pp.187-204 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/12911 | - |
| dc.description.abstract | Separation dimension of a hypergraph H, denoted by ?( H) , is the smallest natural number k so that the vertices of H can be embedded in Rk such that any two disjoint edges of H can be separated by a hyperplane normal to one of the axes. We show that the separation dimension of a hypergraph H is equal to the boxicity of the line graph of H. This connection helps us in borrowing results and techniques from the extensive literature on boxicity to study the concept of separation dimension. In this paper, we study the separation dimension of hypergraphs and graphs. 2015, Springer Science+Business Media New York. | en_US |
| dc.title | Separation Dimension of Graphs and Hypergraphs | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.