Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{799976, author = {Hliněný, Petr and Ganian, Robert}, address = {Brno}, booktitle = {Workshop MEMICS 2008}, keywords = {parameterized algorithm; rank-width; tree automaton; MSO logic}, language = {eng}, location = {Brno}, isbn = {978-80-7355-082-0}, pages = {257-257}, publisher = {FI MU}, title = {Automata Approach to Graphs of Bounded Rank-width}, url = {http://www.memics.cz}, year = {2008} }
TY - JOUR ID - 799976 AU - Hliněný, Petr - Ganian, Robert PY - 2008 TI - Automata Approach to Graphs of Bounded Rank-width PB - FI MU CY - Brno SN - 9788073550820 KW - parameterized algorithm KW - rank-width KW - tree automaton KW - MSO logic UR - http://www.memics.cz N2 - Rank-width is a rather new structural graph measure introduced by Oum and Seymour in 2003 in order to find an efficiently computable approximation of clique-width of a graph. Being a very nice graph measure indeed, the only serious drawback of rank-width was that it is virtually impossible to use a given rank-decomposition of a graph for running dynamic algorithms on it. We propose a new independent description of rank-decompositions of graphs using labeling parse trees which is, after all, mathematically equivalent to the recent algebraic graph-expression approach to rank-decompositions of Courcelle and Kant\'e [WG'07]. We then use our labeling parse trees to build a Myhill-Nerode-type formalism for handling restricted classes of graphs of bounded rank-width, and to directly prove that (an already indirectly known result) all graph properties expressible in MSO logic are decidable by finite automata running on the labeling parse trees. ER -
HLINĚNÝ, Petr a Robert GANIAN. Automata Approach to Graphs of Bounded Rank-width. Online. In \textit{Workshop MEMICS 2008}. Brno: FI MU, 2008. s.~257. ISBN~978-80-7355-082-0. [citováno 2024-04-23]
|