394 search results - page 14 / 79 » Testing subgraphs in large graphs |
150
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
142
Voted
JGT
2007
15 years 5 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
146
click to vote
GD
1995
Springer
15 years 9 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
159
click to vote
ISCAS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
187
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...