4865 search results - page 153 / 973 » The Complexity of Graph Connectivity |
99
Voted
SIAMDM
2008
15 years 2 days ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
82
Voted
ECHT
1992
15 years 4 months ago
1992
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
96
Voted
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
123
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
122
click to vote
CORR
2010
Springer
15 years 21 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...