212 search results - page 33 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
114
Voted
CORR
2007
Springer
15 years 16 days ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
109
Voted
STOC
2004
ACM
16 years 26 days ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
104
click to vote
DAM
2007
15 years 16 days ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
106
click to vote
SIAMDM
2008
15 years 15 days ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
96
Voted
PVLDB
2010
14 years 11 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...