Sciweavers

1154 search results - page 121 / 231
» On the editing distance of graphs
Sort
View
DAM
2008
82views more  DAM 2008»
13 years 10 months ago
Closest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
SIAMJO
2008
144views more  SIAMJO 2008»
13 years 10 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...
PREMI
2005
Springer
14 years 3 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 10 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
SAC
2009
ACM
14 years 4 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang