2612 search results - page 140 / 523 » Switching Graphs and Their Complexity |
113
click to vote
VLDB
2002
ACM
15 years 12 days ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
81
Voted
EJC
2007
15 years 22 days ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
108
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
84
Voted
DIAGRAMS
2006
Springer
15 years 4 months ago
2006
Springer
We argue that a comprehensive model of graph comprehension must include spatial cognition. We propose that current models of graph comprehension have not needed to incorporate spat...
101
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...