z-logo
open-access-imgOpen Access
Computing commons interval of K permutations, with applications to modular decomposition of graphs
Author(s) -
Anne Bergeron,
Cédric Chauve,
Fabien de Montgolfier,
Mathieu Raffinot
Publication year - 2005
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - modular design , interval (graph theory) , computer science , decomposition , modular decomposition , theoretical computer science , combinatorics , mathematics , pathwidth , programming language , graph , ecology , line graph , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom