356 search results - page 21 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
PG
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
106
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
109
click to vote
ALGORITHMICA
2006
15 years 13 days ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
121
click to vote
TON
2012
13 years 2 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
84
Voted
CORR
2008
Springer
15 years 13 days ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...