Balanced vertex-orderings of graphs
Authors:
- Therese BiedlTBTherese Biedl
- Timothy ChanTCTimothy Chan
- Yashar GanjaliYGYashar Ganjali
- Mohammad Taghi HajiaghayiMHMohammad Taghi Hajiaghayi
- David R. WoodDWDavid R. Wood
- 1 April 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 148 (1) , 27-48
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Optimal three-dimensional orthogonal graph drawing in the general position modelTheoretical Computer Science, 2003
- On the complexity of bicoloring clique hypergraphs of graphsJournal of Algorithms, 2002
- A better heuristic for orthogonal graph drawingsComputational Geometry, 1998
- Algorithms for area-efficient orthogonal drawingsComputational Geometry, 1998
- Tight Bounds for the Maximum Acyclic Subgraph ProblemJournal of Algorithms, 1997
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problemsTheoretical Computer Science, 1997
- Drawing planar graphs using the canonical orderingAlgorithmica, 1996
- Bipolar orientations revisitedDiscrete Applied Mathematics, 1995
- Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivityCombinatorica, 1994
- Planar orientations with low out-degree and compaction of adjacency matricesTheoretical Computer Science, 1991