Covering Graphs by Simple Circuits

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1981 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 10, pages 746-750 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Alon Itai; Richard J. Lipton; Christos H. Papadimitriou; Michael Rodeh;

doi: 10.1137/0210058

Covering Graphs by Simple Circuits

- Summary
- Subjects
- Metrics

Abstract

We show that any biconnected graph with n nodes and m edges can be covered by simple circuits whose total length is at most $\min (3m,m + 6n)$. Our proof suggests an efficient algorithm for finding such a cover.

Keywords

graph algorithms, Connectivity, Eulerian and Hamiltonian graphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Eulerian subgraphs, Graph theory (including graph drawing) in computer science, edge connectivity

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	41
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average