Author of the publication

Double independence and tree pairs in graphs.

, and . I. J. Circuit Theory and Applications, 24 (6): 657-666 (1996)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Dense Edge-Disjoint Embedding of Binary Trees in the Mesh., and . SPAA, page 257-263. ACM, (1992)Optimally Edge-Colouring Outerplanar Graphs is in NC., and . Theor. Comput. Sci., 71 (3): 401-411 (1990)Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems., , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)Superperfect pairs of trees in graphs., and . I. J. Circuit Theory and Applications, 21 (2): 183-189 (1993)Perfect pairs of trees associated with a prescribed tree: An algorithmic approach., and . I. J. Circuit Theory and Applications, 20 (6): 681-688 (1992)Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique., , , and . Comput. J., 46 (4): 391-400 (2003)Double independence and tree pairs in graphs., and . I. J. Circuit Theory and Applications, 24 (6): 657-666 (1996)Deterministic broadcasting in unknown radio networks., , , , and . SODA, page 861-870. ACM/SIAM, (2000)DNA Simulation of Boolean Circuits, , and . Genetic Programming 1998: Proceedings of the Third Annual Conference, page 679--683. University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann, (22-25 July 1998)On the PVM Computations of Transitive Closure and Algebraic Path Problems., , , and . PVM/MPI, volume 1497 of Lecture Notes in Computer Science, page 338-345. Springer, (1998)