Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Uložené v:
Podrobná bibliografia
Vydané v:Algorithmica Ročník 39; číslo 4; s. 321 - 347
Hlavní autori: Gramm, Jens, Guo, Jiong, Hüffner, Falk, Niedermeier, Rolf
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY Springer 01.05.2004
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Tree(graph)
Algorithm engineering
Graph modification
Complete graph
Case based reasoning
Search tree algorithms
Automated development and analysis of algorithms
Search algorithm
NP-hard problems
NP hard problem
Automatic generation
Search tree
Algorithm analysis
Exact algorithms
ISSN:0178-4617, 1432-0541
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-004-1090-5