Sciweavers

334 search results - page 1 / 67
» Improved Algorithms and Complexity Results for Power Dominat...
Sort
View
COCOON
2005
Springer
13 years 11 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
ACSC
2007
IEEE
13 years 11 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka
DATE
2002
IEEE
105views Hardware» more  DATE 2002»
13 years 10 months ago
Power-Manageable Scheduling Technique for Control Dominated High-Level Synthesis
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
Chunhong Chen, Majid Sarrafzadeh
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 3 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...