Sciweavers

678 search results - page 41 / 136
» Structural Properties of Sparse Graphs
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
COLING
2000
13 years 10 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
AUIC
2003
IEEE
14 years 2 months ago
Keg Master: a Graph-Aware Visual Editor for 3D Graphs
This paper presents Keg Master, a graph-aware visual editor for 3D graphs. Keg Master is novel in that it works with a graph description language as opposed to a scene graph descr...
Hannah Slay, Matthew Phillips, Bruce H. Thomas, Ru...
DAGM
2008
Springer
13 years 10 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
ICPR
2006
IEEE
14 years 10 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu