We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classicalâ€¦ (More)

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classicalâ€¦ (More)

Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These resultsâ€¦ (More)

Broadcast domination assigns an integer value f(u) 0 to each vertex u of a given graph, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. We can regard theâ€¦ (More)

It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it isâ€¦ (More)

For an arbitrary lled graph G + of a given original graph G, we consider the problem of removing ll edges from G + in order to obtain a graph M that is both a minimal lled graph of G and a subgraphâ€¦ (More)

We present a self-stabilizing algorithm for the distance-2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Î”m) moves using at most Î” + 1 colors, whereâ€¦ (More)

Graph search algorithms have exploited and in some cases identi ed graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graphâ€¦ (More)

An information set in a game tree is a set of nodes from which the rules of the game require that the same alternative (i.e., move) be selected. Thus the nodes an information set areâ€¦ (More)