Computing cyclic invariants for molecular graphs

DOI10.1002/NET.21757MaRDI QIDQ6496347zbMATH OpenFDO

Authors Franziska Berger, Peter Gritzmann, Sven De Vries

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

zbMATH Keywords

invariantsefficient algorithmsminimum cycle basisessential cycleschemical graphsrelevant cycles

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 477971 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 1368469 (Why is no real title available?)
• Automata, Languages and Programming
• Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
• Circuit bases of strongly connected digraphs
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Finding the K Shortest Loopless Paths in a Network
• Finding the k Shortest Paths
• Geometric algorithms and combinatorial optimization
• Interchangeability of relevant cycles in graphs
• Minimal cycle bases of outerplanar graphs
• Minimum Cycle Bases and Their Applications
• Minimum cycle bases for network graphs
• Minimum cycle bases, faster and simpler
• On the cut polytope
• Powers of tensors and fast matrix multiplication
• Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.
• The complexity of theorem-proving procedures
• Union of all the minimum cycle bases of a graph
• When do short cycles generate the cycle space?

This page was built for publication: Computing cyclic invariants for molecular graphs

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