Name
Abstract | ||
|---|---|---|
The carving-width of a graph is the minimum congestion of routing trees for the graph. We determine the carving-width of generalized hypercubes: Hamming graphs, even grids, and tori. Our results extend the result of Chandran and Kavitha [L.S. Chandran, T. Kavitha, The carvingwidth of hypercubes, Discrete Math. 306 (2006) 2270-2274] that determines the carving-width of hypercubes. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.06.039 | Discrete Mathematics |
Keywords | Field | DocType |
hamming graph,grid,torus,carving-width,hypercube | Discrete mathematics,Graph,Combinatorics,Carving,Tree (graph theory),Hypercube,Mathematics,Grid,Hamming graph | Journal |
Volume | Issue | ISSN |
310 | 21 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.39 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kyohei Kozawa | 1 | 23 | 3.21 |
| Yota Otachi | 2 | 161 | 37.16 |
| Koichi Yamazaki | 3 | 222 | 21.85 |