1002 search results - page 13 / 201 » Towards Graph Programs for Graph Algorithms |
COMBINATORICA
2008
14 years 12 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
ENTCS
2008
14 years 12 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
183
click to vote
VLDB
2007
ACM
16 years 19 hour ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...