Polynomial algorithms for canonical forms of orientations

DOI10.1007/S10878-014-9735-ZzbMATH Open1331.05211OpenAlexW2064629431MaRDI QIDQ5963618FDOQ5963618

Martin Kochol

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9735-z

Recommendations

• Tension-flow polynomials on graphs
• A bijection for Eulerian-equivalence classes of totally cyclic orientations
• Generating the Acyclic Orientations of a Graph
• Bipolar orientations revisited
• scientific article; zbMATH DE number 17787

zbMATH Keywords

flowsearch algorithmtension and Tutte polynomialstotally cyclic and acyclic orientation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Depth-First Search and Linear Graph Algorithms
• Digraphs
• Tension polynomials of graphs
• Bounds on the coefficients of tension and flow polynomials
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• Inside-out polytopes
• Ehrhart theory, modular flow reciprocity, and the Tutte polynomial
• Polynomials associated with nowhere-zero flows
• A bijection for Eulerian-equivalence classes of totally cyclic orientations
• Nowhere-harmonic colorings of graphs

Cited In (4)

• Algorithms to solve absolute orientation problem for GL(3), O(3), and SO(3) groups
• Interpretations of the Tutte and characteristic polynomials of matroids
• Interpretations of the Tutte polynomials of regular matroids
• Computing Canonical Polygonal Schemata with Generalized Maps

This page was built for publication: Polynomial algorithms for canonical forms of orientations

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