Sciweavers

12 search results - page 1 / 3
» Weighted Independent Perfect Domination on Cocomparability G...
Sort
View
ISAAC
1993
Springer
134views Algorithms» more  ISAAC 1993»
13 years 7 months ago
Weighted Independent Perfect Domination on Cocomparability Graphs
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
DM
1998
100views more  DM 1998»
13 years 3 months ago
Upper domination and upper irredundance perfect graphs
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
Gregory Gutin, Vadim E. Zverovich
RSA
2002
87views more  RSA 2002»
13 years 3 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 7 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 3 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang