Propriétés algorithmiques des extensions linéaires

Autor: Bouchitte, Vincent

Th.--Inform.--Montpellier 2, 1987.

Externí odkaz: http://catalogue.bnf.fr/ark:/12148/cb376032688

Listing all potential maximal cliques of a graph

Autor: Bouchitté, Vincent ^*, Todinca, Ioan

Publikováno v: In Theoretical Computer Science 2002 276(1):17-32

Treewidth of planar graphs: connections with duality

Autor: Bouchitté, Vincent, Mazoit, Frédéric, Todinca, Ioan

Publikováno v: In Electronic Notes in Discrete Mathematics 2001 10:34-38

Chordal embeddings of planar graph

Autor: Bouchitté, Vincent, Mazoit, Frédéric, Todinca, Ioan

Publikováno v: [Research Report] Laboratoire de l'informatique du parallélisme. 2001, 2+14p

Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved the conjecture in the affirmative, using algebraic techniques. We give here a much shorter proof of t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c388bfd85b0cff3c996293c27b5c54d4
https://hal-lara.archives-ouvertes.fr/hal-02101804/document

Optimal Deadlock-free Path-based Multicast Algorithms in Meshes

Autor: Bouchitté, Vincent, Cohen, Johanne, Fleury, Eric

Publikováno v: [Research Report] LIP RR-1997-31, Laboratoire de l'informatique du parallélisme. 1997, 2+13p
5th International Colloquium on Structural Information & Communication Complexity (SIROCCO'98)
5th International Colloquium on Structural Information & Communication Complexity (SIROCCO'98), 1998, Amalfi, Italy, 17 p

Multicasting is an information dissemination problem which consists, for a node of a distributed memory parallel computer, of sending the same message to an arbitrary subset of nodes. The two major criteria to be considered in multicast communication

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d2cca4f57ad0b5f9ce65c6812e70c09e
https://hal-lara.archives-ouvertes.fr/hal-02102049/file/RR1997-31.pdf