Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514592 | Electronic Notes in Discrete Mathematics | 2005 | 8 Pages |
Abstract
We define Algorithm MLS which uses a labelling structure to generalize all known graph searches which compute a peo on a chordal graph, as well as its extension MLSM, which computes an meo on an arbitrary graph. We also examine the vertices numbered as 1 by these algorithms, and show how they can be seen as extremities of the graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Anne Berry, Jean Blair, Jean-Paul Bordat, Richard Krueger, Geneviève Simonet,