Sciweavers

Share
WG
2005
Springer
10 years 2 months ago
Recognizing HHDS-Free Graphs
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
Stavros D. Nikolopoulos, Leonidas Palios
WG
2005
Springer
10 years 2 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
WG
2005
Springer
10 years 2 months ago
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
Van Bang Le, Raffaele Mosca, Haiko Müller
WG
2005
Springer
10 years 2 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
WG
2005
Springer
10 years 2 months ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
WG
2005
Springer
10 years 2 months ago
Approximation Algorithms for the Weighted Independent Set Problem
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...
WG
2005
Springer
10 years 2 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
WG
2005
Springer
10 years 2 months ago
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
Omer Giménez, Petr Hlinený, Marc Noy
books