The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Supporting CAE parallel computations with IE-graph solid representation.”

Graph drawing in motion.

Friedrich, Carsten, Eades, Peter (2002)

Journal of Graph Algorithms and Applications

Similarity:

Clique graph representations of ptolemaic graphs

Terry A. Mckee (2010)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is ptolemaic if and only if it is both chordal and distance-hereditary. Thus, a ptolemaic graph G has two kinds of intersection graph representations: one from being chordal, and the other from being distance-hereditary. The first of these, called a clique tree representation, is easily generated from the clique graph of G (the intersection graph of the maximal complete subgraphs of G). The second intersection graph representation can also be generated from the clique graph,...