26 search results - page 4 / 6 » Contractibility and the clique graph operator |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
65
Voted
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
73
Voted
PARELEC
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
JCT
2007
14 years 9 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...