Sciweavers

3105 search results - page 108 / 621
» The Path-Packing Structure of Graphs
Sort
View
141
Voted
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
15 years 7 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
GD
2006
Springer
15 years 7 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle
145
Voted
AAAI
2000
15 years 4 months ago
Graph Construction and Analysis as a Paradigm for Plan Recognition
We present a novel approach to plan recognition in which graph construction and analysis is used as a paradigm. We use a graph structure called a Goal Graph for the plan recogniti...
Jun Hong
IV
2010
IEEE
158views Visualization» more  IV 2010»
15 years 1 months ago
An Interactive Visualization Framework for Time-Series of Web Graphs in a 3D Environment
We propose an interactive framework for the 3D visualization of the time-series of Web graphs. The purpose of our framework is to enable users to examine the evolution of Web grap...
Masahiko Itoh, Masashi Toyoda, Masaru Kitsuregawa
151
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe