183 search results - page 4 / 37 » On the Matching Problem for Special Graph Classes |
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
63
Voted
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
SIBGRAPI
2005
IEEE
15 years 3 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
128
click to vote
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
WG
2001
Springer
15 years 1 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...