1188 search results - page 81 / 238 » Extended Graph Unification |
93
Voted
ESA
2005
Springer
15 years 6 months ago
2005
Springer
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
107
click to vote
ESA
2001
Springer
15 years 5 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
100
Voted
CPC
2007
15 years 23 days ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
99
Voted
JLP
2006
15 years 23 days ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
134
Voted
ICDM
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a hybrid clustering strategy by integrating heterogeneous information sources as graphs. The hybrid clustering method is extended on the basis of modularity based Louva...