( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
(α, β)-Modules in Graphs.

, , , и . CoRR, (2021)

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.

Habib Reda Habib Ebrahim

Sahar Habib

Khosrow Habibi

Ayman Habib

Elham Habibi

 

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

Approximating Modular Decomposition Is Hard., , и . CALDAM, том 12016 из Lecture Notes in Computer Science, стр. 53-66. Springer, (2020)Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs., , , , и . Electron. Notes Discret. Math., (2008)Diameter and Center Computations in Networks.. CTW, стр. 257-258. (2009)Polynomial-Time Algorithm for the Leafage of Chordal Graphs., и . ESA, том 5757 из Lecture Notes in Computer Science, стр. 290-300. Springer, (2009)A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension., , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2004)Algorithms for Some H-Join Decompositions., , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 446-457. Springer, (2012)A simple paradigm for graph recognition: application to cographs and distance hereditary graphs., , и . Theor. Comput. Sci., 263 (1-2): 99-111 (2001)Tree Structure for Distributive Lattices and its Applications., и . Theor. Comput. Sci., 165 (2): 391-405 (1996)When an optimal dominating set with given constraints exists., , , , , и . Theor. Comput. Sci., (2019)Subquadratic-time algorithm for the diameter and all eccentricities on median graphs., , и . CoRR, (2021)