MPI-I-96-1-009. March 1996, 18 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
We give a state-of-the-art survey of the thickness of a graph from both a theoretical and a practical point of view. After summarizing the relevant results concerning this topological invariant of a graph, we deal with practical computation of the thickness.
We present some modifications of a basic heuristic and investigate their usefulness for evaluating the thickness and determining a decomposition of a graph in planar subgraphs.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
286 KBytes; 222 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |