Sciweavers

3958 search results - page 145 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
146
Voted
PATMOS
2004
Springer
15 years 11 months ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
WDAG
1998
Springer
98views Algorithms» more  WDAG 1998»
15 years 10 months ago
Sense of Direction in Distributed Computing
Sense of direction is a property of labeled graphs which has been shown to have a de
Paola Flocchini, Bernard Mans, Nicola Santoro
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 9 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
COCOA
2007
Springer
16 years 16 days ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
147
Voted
JEA
2008
88views more  JEA 2008»
15 years 6 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt