Sciweavers

5889 search results - page 52 / 1178
» Graph Layout Problems
Sort
View
123
Voted
ICALP
2007
Springer
15 years 6 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
ECCC
2010
124views more  ECCC 2010»
14 years 7 months ago
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
Hao Huang, Benny Sudakov
AAAI
1998
15 years 1 months ago
Toward Design as Collaboration
In design, multiple disparate goals must be addressed simultaneously. It is the thesis of this work that problems in two-dimensional layout design can be solved by collaboration a...
Susan L. Epstein
GD
1998
Springer
15 years 4 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
ICDAR
2007
IEEE
15 years 7 months ago
Performance Analysis Framework for Layout Analysis Methods
This paper presents a new framework for in-depth analysis of the performance of layout analysis methods. Contrary to existing approaches aimed at evaluation or benchmarking, the p...
Apostolos Antonacopoulos, David Bridson