Sciweavers

3105 search results - page 100 / 621
» The Path-Packing Structure of Graphs
Sort
View
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
15 years 2 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...
ICDAR
2003
IEEE
15 years 8 months ago
Graph Grammar Based Analysis System of Complex Table Form Document
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
Akira Amano, Naoki Asada
134
Voted
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 13 days 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&...
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 3 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
141
Voted
LICS
2010
IEEE
15 years 1 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