Sciweavers

478 search results - page 17 / 96
» Structural Properties of Twin-Free Graphs
Sort
View
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
13 years 8 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
WISE
2000
Springer
14 years 29 days ago
Visualization of Web-based Workspace Structures
Web-based collaboration is becoming increasingly common. Often such collaboration exhibits emergent characteristics, for which systems based on a notion of workspaces provide suit...
Robert P. Biuk-Aghai
DCC
2008
IEEE
14 years 8 months ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 5 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
LICS
2010
IEEE
13 years 6 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe