554 search results - page 34 / 111 » Power Domination Problem in Graphs |
ISCA
2005
IEEE
14 years 1 months ago
2005
IEEE
One of the most important problems faced by microarchitecture designers is the poor scalability of some of the current solutions with increased clock frequencies and wider pipelin...
FOCS
2000
IEEE
13 years 11 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 ...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
JDA
2006
13 years 7 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...