6740 search results - page 371 / 1348 » An s -Hamiltonian Line Graph Problem |
145
Voted
JGAA
2002
15 years 4 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
119
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
158
Voted
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
131
Voted
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
124
Voted
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...