A note to independent sets in scheduling

Jan Černý

Displaying similar documents to “A note to independent sets in scheduling”

A decomposition heuristic for the maximal covering location problem.

Senne, Edson Luiz França, Pereira, Marcos Antonio, Lorena, Luiz Antonio Nogueira (2010)

Advances in Operations Research

Similarity:

Decomposition tree and indecomposable coverings

Andrew Breiner, Jitender Deogun, Pierre Ille (2011)

Discussiones Mathematicae Graph Theory

Similarity:

Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X] = (X,A ∩ (X×X)) of G induced by X. A subset X of V is an interval of G provided that for a,b ∈ X and x ∈ V∖X, (a,x) ∈ A if and only if (b,x) ∈ A, and similarly for (x,a) and (x,b). For example ∅, V, and {x}, where x ∈ V, are intervals of G which are the trivial intervals. A directed graph is indecomposable if all its intervals are trivial. Given an integer k > 0, a directed graph G =...

Centers in line graphs

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity:

Centers in iterated line graphs.

Knor, M., Niepel, L., Olts, L. (1992)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

On some path problems on oriented hypergraphs

S. Nguyen, D. Pretolani, L. Markenzon (1998)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Distributed approach for solving time-dependent problems in multimodal transport networks.

Galvez-Fernandez, Carlos, Khadraoui, Djamel, Ayed, Hedi, Habbas, Zineb, Alba, Enrique (2009)

Advances in Operations Research

Similarity: