Suchergebnisse - "optimal output-sensitive algorithm"

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs

Autoren: Ferreira Rui GROSSI, ROBERTO Rizzi Romeo

Quelle: Lecture Notes in Computer Science ISBN: 9783642237188

Schlagwörter: listing, enumeration, k-trees, output sensitive, trees of size k, optimal output-sensitive algorithm, listing algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, 01 natural sciences, 7. Clean energy

Zugangs-URL: https://hdl.handle.net/11562/409578
http://www.springerlink.com/content/582565320x0031k2/
https://hdl.handle.net/11568/145580

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.

Autoren: R. A. FERREIRA R. GROSSI RIZZI, ROMEO et al.

Weitere Verfasser: R. A. FERREIRA R. GROSSI RIZZI, ROMEO et al.

Schlagwörter: listing, enumeration, k-tree, output sensitive, trees of size k, optimal output-sensitive algorithm, listing algorithm

Dateibeschreibung: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783642237188; info:eu-repo/semantics/altIdentifier/wos/WOS:000342826700024; ispartofbook:ESA 2011 - Lecture Notes in Computer Science 6942; Algorithms - ESA 2011 - 19th Annual European Symposium; volume:6942; firstpage:275; lastpage:286; numberofpages:12; alleditors:Camil Demetrescu, Magnús M. Halldórsson; http://hdl.handle.net/11562/409578; http://www.springerlink.com/content/582565320x0031k2/

Verfügbarkeit: http://hdl.handle.net/11562/409578
http://www.springerlink.com/content/582565320x0031k2/