Sciweavers

132 search results - page 6 / 27
» Simplices and Spectra of Graphs
Sort
View
TVCG
2012
184views Hardware» more  TVCG 2012»
11 years 10 months ago
Output-Sensitive Construction of Reeb Graphs
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
Harish Doraiswamy, Vijay Natarajan
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
GC
2008
Springer
13 years 7 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
EMMCVPR
2011
Springer
12 years 7 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
COLING
2010
13 years 2 months ago
Multi-Sentence Compression: Finding Shortest Paths in Word Graphs
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
Katja Filippova