Weighted Matching in the Semi-Streaming Model

We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model. The semi-streaming model forbids random access to the input graph and restricts the memory to bits where n denotes the number of the vertices of the input graph. We obtain an approximat...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 62; číslo 1-2; s. 1 - 20
Hlavní autor:	Zelke, Mariano
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.02.2012 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Software Theoretical computing Theory of Computation Matching Approximation algorithm Semi-streaming algorithm Graph algorithm Streaming Access control Random access Modeling Weighted graph Graph matching
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!