Sciweavers

3105 search results - page 53 / 621
» The Path-Packing Structure of Graphs
Sort
View
136
Voted
STACS
2010
Springer
15 years 7 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
Neelesh Khanna, Surender Baswana
235
Voted
ACL
2003
15 years 4 months ago
Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, Eisaku M...
105
Voted
ICVS
2003
Springer
15 years 7 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock
116
Voted
IM
2008
15 years 2 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
133
Voted
ICML
2005
IEEE
16 years 3 months ago
Predicting protein folds with structural repeats using a chain graph model
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
Yan Liu, Eric P. Xing, Jaime G. Carbonell