Approximation Algorithms for Intersection Graphs

We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of its neighbors. We call a graph k-perfectly groupable if S ( v ) consists of all neighbors, k-simplicial if S ( v ) consists of the neighbors wi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 68; číslo 2; s. 312 - 336
Hlavní autori:	Kammer, Frank, Tholey, Torsten
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.02.2014 Springer
Predmet:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Convex and discrete geometry Data Structures and Information Theory Exact sciences and technology Flows in networks. Combinatorial problems Geometry Information retrieval. Graph Mathematics Mathematics of Computing Operational research and scientific management Operational research. Management science Sciences and techniques of general use Theoretical computing Theory of Computation Parameterized approximation algorithms Graph algorithms NP-hard problems Intersection graphs Intersection Partition Tree(graph) Dominating set Similarity Graph clique Chordal graph Graph theory Approximation algorithm Polynomial time Upper bound NP hard problem Graph colouring Independent set Intersection graph Parameterized complexity
ISSN:	0178-4617, 1432-0541
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!