On Independent Sets and Bicliques in Graphs

Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. In this paper we improve Prisner’s upper bound on the number of maximal bicliques (Combinatorica, 20, 109–117, 2000 ) and show that the maximum number of maximal bicliques in a graph on n vert...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 62; číslo 3-4; s. 637 - 658
Hlavní autoři:	Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.04.2012 Springer Springer Verlag
Témata:	Algorithm Analysis and Problem Complexity Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Theoretical computing Theory of Computation Exact exponential time algorithm Maximal independent sets Maximal bicliques Counting algorithms Combinatorial bound Branching Independent graph Polynomial time Upper bound Bicyclic graph Independent set Maximal graph Time complexity Combinatorial analysis Counting
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!