A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Carl-Christian Kanne, Guido Moerkotte
A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix
VLDB, 2006.

VLDB 2006
DBLP
Scholar
?EE?
Full names Links ISxN
@inproceedings{VLDB-2006-KanneM,
	acmid         = "1164137",
	author        = "Carl-Christian Kanne and Guido Moerkotte",
	booktitle     = "{Proceedings of the 32nd International Conference on Very Large Data Bases}",
	ee            = "http://www.vldb.org/conf/2006/p91-kanne.pdf",
	isbn          = "1-59593-385-9",
	pages         = "91--102",
	publisher     = "{ACM}",
	title         = "{A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix}",
	year          = 2006,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.