244 search results - page 28 / 49 » Intervalizing k-Colored Graphs |
100
click to vote
DM
2008
15 years 2 months ago
2008
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
135
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
87
Voted
DAM
2006
15 years 2 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
114
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
129
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...