641 search results - page 44 / 129 » On Planar Quasi-Parity Graphs |
112
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
126
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
120
click to vote
TAMC
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
COMBINATORICA
2008
15 years 2 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
102
click to vote
MMAS
2010
Springer
14 years 8 months ago
2010
Springer
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...