( en | de | ru )

 

Disambiguation of "Bordat, Jean Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Graph Extremities Defined by Search Algorithms.

, , , and . Algorithms, 3 (2): 100-124 (2010)

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.

Jean Paul

Josef Bordat

Nicolas Jeanvoine

Plasma-material interaction and electrode degradation in high voltage ignition discharges. Uni Saarbrücken, (2009)

Johann Jeanson

Helga Jeanblanc

 

Other publications of authors with the same name

Generating All the Minimal Separators of a Graph., , and . Int. J. Found. Comput. Sci., 11 (3): 397-403 (2000)Separability Generalizes Dirac's Theorem., and . Discret. Appl. Math., 84 (1-3): 43-53 (1998)A wide-range algorithm for minimal triangulation from an arbitrary ordering., , , , and . J. Algorithms, 58 (1): 33-66 (2006)Generating All the Minimal Separators of a Graph., , and . WG, volume 1665 of Lecture Notes in Computer Science, page 167-172. Springer, (1999)Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes.. Discret. Appl. Math., 12 (3): 215-231 (1985)Efficient polynomial algorithms for distributive lattices.. Discret. Appl. Math., 32 (1): 31-50 (1991)Graph Extremities Defined by Search Algorithms., , , and . Algorithms, 3 (2): 100-124 (2010)Recognizing Weakly Triangulated Graphs by Edge Separability., , and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 139-149. Springer, (2000)Note sur la recherche des monomes maximaux en algebre de post.. Discret. Math., 17 (3): 323-326 (1977)Complexité De Problèmes Liés Aux Graphes Sans Circuit.. RAIRO Theor. Informatics Appl., 21 (2): 181-197 (1987)