Boxicity, Cubicity And Vertex Cover
The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding vertices of G are adjacent. An axis-parallel box is a generalized rectangle with...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/890 |