Computing cyclic invariants for molecular graphs

DOI10.1002/NET.21757MaRDI QIDQ6496347

Peter Gritzmann, Franziska Berger, 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

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

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