356 search results - page 31 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
103
Voted
ASPDAC
2005
ACM
15 years 2 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
SIROCCO
2010
15 years 1 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
131
click to vote
CCCG
2003
15 years 1 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
96
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
110
Voted
ICDE
2010
IEEE
16 years 4 days ago
2010
IEEE
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...