Balanced vertex-orderings of graphs
type: Item
instance of: scholarly article
title: Balanced vertex-orderings of graphs
zbMATH Open document ID: 1060.05088
author: Yashar Ganjali
author: David R. Wood
author: Therese Biedl
author: Timothy M. Chan
author: Mohammad T. Hajiaghayi
published in: Discrete Applied Mathematics
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2165427
zbMATH Keywords: Graph algorithm
zbMATH Keywords: Graph drawing
zbMATH Keywords: Vertex-ordering
zbMATH Keywords: Balanced
MaRDI profile type: Publication
full work available at URL: j.dam.2004.12.001
OpenAlex ID: W2139924054
cites work: Tight Bounds for the Maximum Acyclic Subgraph Problem
cites work: A better heuristic for orthogonal graph drawings
cites work: Area-efficient static and incremental graph drawings
cites work: The three-phase method: a unified approach to orthogonal graph drawing
cites work: Time bounds for selection
cites work: Q4411363
cites work: Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
cites work: Planar orientations with low out-degree and compaction of adjacency matrices
cites work: Q3619797
cites work: Q4393480
cites work: Bipolar orientations revisited
cites work: How to draw a planar graph on a grid
cites work: A fast and effective heuristic for the feedback arc set problem
cites work: Three-dimensional orthogonal graph drawing algorithms
cites work: st-ordering the vertices of biconnected graphs
cites work: Computing an st-numbering
cites work: Q4198056
cites work: Drawing planar graphs using the canonical ordering
cites work: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
cites work: Q4142699
cites work: On the complexity of bicoloring clique hypergraphs of graphs
cites work: Q5596083
cites work: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs
cites work: Q4856179
cites work: Algorithms for area-efficient orthogonal drawing
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: The complexity of satisfiability problems
cites work: Q3719851
cites work: Q4501708
cites work: Optimal three-dimensional orthogonal graph drawing in the general position model.
cites work: Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
DOI: 10.1016/J.DAM.2004.12.001
description: scientific article; zbMATH DE number 2165427