554 search results - page 20 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
GD
2004
Springer
14 years 2 months ago
2004
Springer
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
ALGORITHMICA
2011
13 years 3 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
ANOR
2005
13 years 8 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
ASPDAC
2001
ACM
14 years 14 days ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
IJSNET
2007
13 years 8 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...