( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.

, , , , и . CoRR, (2014)

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

 

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

Listing Chordal Graphs and Interval Graphs., , и . WG, том 4271 из Lecture Notes in Computer Science, стр. 68-77. Springer, (2006)Optimization algorithm for k-anonymization of datasets with low information loss., и . Int. J. Inf. Sec., 17 (6): 631-644 (2018)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , и . CoRR, (2014)An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence., и . J. Comb. Optim., 13 (3): 243-262 (2007)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)Single versus Multiple Sorting in All Pairs Similarity Search., , , и . ACML, том 13 из JMLR Proceedings, стр. 145-160. JMLR.org, (2010)Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph., , , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 150-161. Springer, (2017)Transforming spanning trees: A lower bound., , , и . Comput. Geom., 42 (8): 724-730 (2009)On listing, sampling, and counting the chordal graphs with edge constraints., , , и . Theor. Comput. Sci., 411 (26-28): 2591-2601 (2010)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , и . Theor. Comput. Sci., (2021)