120 search results - page 16 / 24 » Cycle lengths in sparse graphs |
107
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
125
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
137
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
146
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
132
click to vote
WADS
2001
Springer
15 years 6 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...