Sciweavers

1188 search results - page 31 / 238
» Extended Graph Unification
Sort
View
GG
2004
Springer
14 years 3 months ago
Parallel Independence in Hierarchical Graph Transformation
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
Annegret Habel, Berthold Hoffmann
WG
2004
Springer
14 years 3 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
BIRTHDAY
2008
Springer
13 years 12 months ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 11 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
ESA
2010
Springer
188views Algorithms» more  ESA 2010»
13 years 7 months ago
Contractions of Planar Graphs in Polynomial Time
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
Marcin Kaminski, Daniël Paulusma, Dimitrios M...