5473 search results - page 185 / 1095 » On the graph isomorphism problem |
176
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
211
click to vote
APIN
1999
15 years 6 months ago
1999
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
297
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
179
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
209
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...