Sciweavers

Share
FSTTCS
2010
Springer
8 years 2 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
IPL
2000
111views more  IPL 2000»
8 years 4 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos
GC
2007
Springer
8 years 4 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
ENDM
2006
96views more  ENDM 2006»
8 years 4 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ENDM
2008
118views more  ENDM 2008»
8 years 4 months ago
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
Flavia Bonomo, Guillermo Durán, Francisco J...
ENDM
2010
111views more  ENDM 2010»
8 years 4 months ago
Clique and chromatic number of circular-perfect graphs
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
Arnaud Pêcher, Annegret Katrin Wagler
DAM
2008
78views more  DAM 2008»
8 years 4 months ago
On classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
Arnaud Pêcher, Annegret Wagler
DAM
2008
63views more  DAM 2008»
8 years 4 months ago
Skew partitions in perfect graphs
We discuss some new and old results about skew partitions in perfect graphs.
Bruce A. Reed
WG
2001
Springer
8 years 8 months ago
Critical and Anticritical Edges in Perfect Graphs
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...
Annegret Wagler
FSTTCS
2007
Springer
8 years 10 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
books