Sciweavers

COLOGNETWENTE
2009
13 years 5 months ago
Two Upper Bounds on the Chromatic Number
María Soto, André Rossi, Marc Sevaux
COLOGNETWENTE
2009
13 years 5 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
COLOGNETWENTE
2009
13 years 5 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos
COLOGNETWENTE
2009
13 years 5 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
COLOGNETWENTE
2009
13 years 5 months ago
Extremal Stable Graphs
Gyula Y. Katona, Illés Horváth
COLOGNETWENTE
2009
13 years 5 months ago
On Self-Duality of Branchwidth in Graphs of Bounded Genus
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been...
Ignasi Sau, Dimitrios M. Thilikos