1395 search results - page 109 / 279 » (k, )-Distance-Hereditary Graphs |
129
click to vote
DAM
2011
14 years 10 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
109
click to vote
SIAMDM
2008
15 years 3 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
117
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
124
click to vote
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
121
click to vote
MFCS
1995
Springer
15 years 7 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...