Další formáty:
BibTeX
LaTeX
RIS
@article{706015, author = {Hliněný, Petr and Gottlob, Georg and Seese, Detlef and Oum, Sangandil}, article_location = {UK}, article_number = {3}, keywords = {tree-width; branch-width; rank-width; hypertree-width; parametrized complexity}, language = {eng}, issn = {0010-4620}, journal = {Computer Journal}, title = {Width Parameters Beyond Tree-width and Their Applications}, url = {http://dx.doi.org/10.1093/comjnl/bxm052}, volume = {51}, year = {2007} }
TY - JOUR ID - 706015 AU - Hliněný, Petr - Gottlob, Georg - Seese, Detlef - Oum, Sang-il PY - 2007 TI - Width Parameters Beyond Tree-width and Their Applications JF - Computer Journal VL - 51 IS - 3 SP - 326-362 EP - 326-362 PB - Oxford University Press SN - 00104620 KW - tree-width KW - branch-width KW - rank-width KW - hypertree-width KW - parametrized complexity UR - http://dx.doi.org/10.1093/comjnl/bxm052 N2 - Besides the very successful concept of tree-width (see [H.~Bodlaender, A.~Koster: {Combinatorial optimisation on graphs of bounded treewidth}]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ``width'' parameters in combinatorial structures delivers --- besides traditional tree-width and derived dynamic programming schemes --- also a number of other useful parameters like branch-width, rank-width (clique-width), or hypertree-width. In this contribution we demonstrate how ``width'' parameters of graphs and generalized structures (like matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level. ER -
HLINĚNÝ, Petr, Georg GOTTLOB, Detlef SEESE a Sang-il OUM. Width Parameters Beyond Tree-width and Their Applications. \textit{Computer Journal}. UK: Oxford University Press, 2007, roč.~51, č.~3, s.~326-362. ISSN~0010-4620.
|