( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Covering a Tree by a Forest.

, и . Graph Theory, Computational Intelligence and Thought, том 5420 из Lecture Notes in Computer Science, стр. 66-76. Springer, (2009)

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.

Gavril Farkas

Gavril Gavrilov

 

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

Maximum weight independent sets and cliques in intersection graphs of filaments.. Inf. Process. Lett., 73 (5-6): 181-188 (2000)Algorithms on Subtree Filament Graphs.. Graph Theory, Computational Intelligence and Thought, том 5420 из Lecture Notes in Computer Science, стр. 27-35. Springer, (2009)Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs.. Discret. Math. Algorithms Appl., 3 (3): 323-336 (2011)Algorithms on Subgraph Overlap graphs.. Discret. Math. Algorithms Appl., (2014)Maximum max-k-clique subgraphs in cactus subtree graphs.. Discret. Math. Algorithms Appl., 15 (6): 2250147:1-2250147:16 (августа 2023)Maximizing Communication Throughput in Tree Networks., , , , и . CoRR, (2019)An Algorithm for Testing Chordality of Graphs.. Inf. Process. Lett., 3 (4): 110-112 (1975)Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs., и . J. Algorithms, 6 (2): 239-252 (1985)Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions., , и . J. Algorithms, 17 (2): 207-221 (1994)New insights on GA-H reduced graphs.. Inf. Process. Lett., (2017)