Fixed-parameter complexity of λ-labelings

A λ-labeling of a graph G is an assignment of labels from the set {0,…, λ} to the vertices of G such that vertices at distance of at most two get different labels and adjacent vertices get labels which are at least two apart. We study the minimum value λ= λ( G) such that G admits a λ-labeling. We sh...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 113; číslo 1; s. 59 - 72
Hlavní autori:	Fiala, Jiřı́, Kloks, Ton, Kratochvı́l, Jan
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Lausanne Elsevier B.V 2001 Amsterdam Elsevier New York, NY
Predmet:	Algorithmics. Computability. Computer arithmetics Applied sciences Channel assignment Computer science; control theory; systems Exact sciences and technology Fixed-parameter complexity Graph cover Graph labeling Theoretical computing Switzerland Europe Graph cover Channel assignment Graph labeling Fixed-parameter complexity Resource allocation Channel allocation Multigraph NP complete problem Graph theory Workshop Graph labelling Overlay 1999 Complexity
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!