Sciweavers

3268 search results - page 426 / 654
» The hub number of a graph
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 10 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
GD
2006
Springer
15 years 10 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
ICSE
2000
IEEE-ACM
15 years 10 months ago
Workshop on standard exchange format (WoSEF)
A workshop was held at ICSE 2000 in Limerick, Ireland to further efforts in the development of a standard exchange format (SEF) for data extracted from and about source code. WoSE...
Susan Elliott Sim, Richard C. Holt, Rainer Koschke
ICDE
2010
IEEE
206views Database» more  ICDE 2010»
15 years 8 months ago
HECATAEUS: Regulating Schema Evolution
HECATAEUS is an open-source software tool for enabling impact prediction, what-if analysis, and regulation of relational database schema evolution. We follow a graph theoretic appr...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
CLA
2007
15 years 8 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig