Jean Paul Bordat

According to our database, Jean Paul Bordat authored at least 13 papers between 1977 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2010

Graph Extremities Defined by Search Algorithms.

Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet

Algorithms, 2010

2007

A local approach to concept generation.

Anne Berry, Jean Paul Bordat, Alain Sigayret

Ann. Math. Artif. Intell., 2007

2006

A wide-range algorithm for minimal triangulation from an arbitrary ordering.

Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger

J. Algorithms, 2006

2005

Extremities and orderings defined by generalized graph search algorithms.

Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet

Electron. Notes Discret. Math., 2005

2001

Moplex elimination orderings.

Anne Berry, Jean Paul Bordat

Electron. Notes Discret. Math., 2001

Asteroidal triples of moplexes.

Anne Berry, Jean Paul Bordat

Discret. Appl. Math., 2001

2000

Recognizing Weakly Triangulated Graphs by Edge Separability.

Anne Berry, Jean Paul Bordat, Pinar Heggernes

Proceedings of the Algorithm Theory, 2000

1999

Generating All the Minimal Separators of a Graph.

Anne Berry, Jean Paul Bordat, Olivier Cogis

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Separability Generalizes Dirac's Theorem.

Anne Berry, Jean Paul Bordat

Discret. Appl. Math., 1998

1991

Efficient polynomial algorithms for distributive lattices.

Jean Paul Bordat

Discret. Appl. Math., 1991

1987

Complexité De Problèmes Liés Aux Graphes Sans Circuit.

Jean Paul Bordat

RAIRO Theor. Informatics Appl., 1987

1985

Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes.

Jean Paul Bordat

Discret. Appl. Math., 1985

1977

Note sur la recherche des monomes maximaux en algebre de post.

Jean Paul Bordat

Discret. Math., 1977