Sciweavers

5 search results - page 1 / 1
» The k-tuple domination number revisited
Sort
View
APPML
2008
82views more  APPML 2008»
13 years 5 months ago
The k-tuple domination number revisited
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
Vadim E. Zverovich
COMPGEOM
1995
ACM
13 years 9 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
COMPUTING
2010
13 years 2 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
WG
2010
Springer
13 years 3 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski
CSR
2007
Springer
13 years 11 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma