( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

, и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 483-494. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Uno Pesonen

Petra Unold

Uno Kaur

Denzo Uno

Wolfram Unold

 

Другие публикации лиц с тем же именем

Ladder-Lottery Realization., , , и . CCCG, стр. 61-67. (2018)Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph., , , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 150-161. Springer, (2017)Listing Chordal Graphs and Interval Graphs., , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 68-77. Springer, (2006)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , и . CoRR, (2014)A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence., и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 724-737. Springer, (2005)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , и . Theor. Comput. Sci., (2021)Counting the number of independent sets in chordal graphs., , и . J. Discrete Algorithms, 6 (2): 229-242 (2008)On Complexity of Flooding Games on Graphs with Interval Representations., , , , и . TJJCCGG, том 8296 из Lecture Notes in Computer Science, стр. 73-84. Springer, (2012)Enumeration of Perfect Sequences of Chordal Graph., , и . ISAAC, том 5369 из Lecture Notes in Computer Science, стр. 859-870. Springer, (2008)Sequentially Swapping Colored Tokens on Graphs., , , , , , , , , и . WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 435-447. Springer, (2017)