Sciweavers

4865 search results - page 100 / 973
» The Complexity of Graph Connectivity
Sort
View
JGAA
2007
135views more  JGAA 2007»
13 years 10 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
COMBINATORICS
2006
100views more  COMBINATORICS 2006»
13 years 10 months ago
Parity Versions of 2-Connectedness
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characte...
C. Little, A. Vince
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
14 years 11 days ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 5 months ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...
EJC
2007
13 years 10 months ago
Chords of longest circuits in locally planar graphs
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zha...