Computing cyclic invariants for molecular graphs

DOI10.1002/NET.21757MaRDI QIDQ6496347FDOQ6496347

Authors: Franziska Berger, Peter Gritzmann, Sven De Vries 

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1522766
• scientific article; zbMATH DE number 614365
• scientific article; zbMATH DE number 166024
• scientific article; zbMATH DE number 51444
• scientific article; zbMATH DE number 4081609

zbMATH Keywords

invariantsefficient algorithmsminimum cycle basisessential cycleschemical graphsrelevant cycles

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

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

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)