296 search results - page 45 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
102
click to vote
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
111
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
81
Voted
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
ACSC
2003
IEEE
15 years 2 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
104
click to vote
KAIS
2011
14 years 4 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...