Skip to main content
Log in

Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs

  • PhD Thesis
  • Published:
4OR Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iuliano, C. Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs. 4OR-Q J Oper Res 11, 393–394 (2013). https://doi.org/10.1007/s10288-012-0221-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-012-0221-0

Navigation