Sciweavers

646 search results - page 41 / 130
» Generalized connected domination in graphs
Sort
View
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 8 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
MST
2006
99views more  MST 2006»
13 years 8 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
ICCAD
1999
IEEE
96views Hardware» more  ICCAD 1999»
14 years 1 months ago
Implication graph based domino logic synthesis
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
Ki-Wook Kim, C. L. Liu, Sung-Mo Kang
GC
2010
Springer
13 years 7 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki