Nesting of prime substructures in k-ary relations

@article{Bonizzoni2001NestingOP,
  title={Nesting of prime substructures in k-ary relations},
  author={Paola Bonizzoni and Ross M. McConnell},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={259},
  pages={341-357}
}
The modular decomposition of a graph or relation has a large number of com-binatorial applications. It divides the structure into a set of \prime" induced sub-structures, which cannot be further decomposed. Recent work on graphs and k-ary relations has focused on the discovery that prime induced substructures are densely nested when they occur. Lower bounds on the \nesting density" of prime substruc-tures in graphs are used heavily in the only known linear-time algorithm for directed graphs. We… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
2 Citations
16 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Algorithmic aspects of comparability graphs and interval graphs

  • R. H. Moehring
  • I. Rival, editor, Graphs and Orders, pages 41{101…
  • 1985
Highly Influential
7 Excerpts

Survey on graphs as 2-structures and parallel complexity of decomposition

  • J. Engelfriet, T. Harju, A. Proskurowski, G. Rozenberg
  • Technical Report 93-06, Department of Computer…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…