Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1348047
Jump to:navigation, search

DOI10.1016/S0010-4655(01)00454-4zbMath0995.68072OpenAlexW1968914159MaRDI QIDQ1348047

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)





Cites Work

  • A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1348047&oldid=13484211"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki