Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k -dimensional box is a Cartesian product R 1 × R 2 × ⋅⋅⋅ × R k where R i (for 1≤ i ≤ k ) is a closed interval of the form [ a i , b i ] on the real line. For a graph G , its boxicity box ( G ) is the minimum dimension k , such that G is representable as the intersection graph of (a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 56; číslo 2; s. 129 - 140
Hlavní autoři:	Chandran, L. Sunil, Francis, Mathew C., Sivadasan, Naveen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.02.2010 Springer
Témata:	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 Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Theoretical computing Theory of Computation Boxicity Randomized algorithm Derandomization Intersection graphs Random graph Graph clique Graph theory Polynomial method Computational complexity Modeling Exact solution Polynomial time Upper bound NP hard problem Independent set Deterministic algorithms
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!