2283 search results - page 73 / 457 » Bounds of Graph Characteristics |
COLOGNETWENTE
2007
13 years 9 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
SODA
1993
ACM
13 years 9 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...