A redundancy eliminating approach to linearly independent rings selection in the ring perception problem

DOI10.1016/S0010-4655(01)00454-4MaRDI QIDQ1348047zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 15 May 2002

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0010-4655(01)00454-4

zbMATH Keywords

ring perception problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Connecting two rings underlying the inclusion-exclusion principle
• The master ring problem
• Exact algorithms for the master ring problem
• scientific article; zbMATH DE number 1522752
• scientific article; zbMATH DE number 4081609

Cites work

• scientific article; zbMATH DE number 108390 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph

This page was built for publication: A redundancy eliminating approach to linearly independent rings selection in the ring perception problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348047)