Polynomial algorithms for canonical forms of orientations

Martin Kochol ()
Additional contact information
Martin Kochol: MÚ SAV

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 15, 218-222

Abstract: Abstract We introduce canonical forms that represent certain equivalence classes of totally cyclic and acyclic orientations of graphs and present a polynomial algorithms for their constructions. The forms are used in new formulas evaluating tension and flow polynomials on graphs.

Keywords: Totally cyclic and acyclic orientation; Search algorithm; Flow; tension and Tutte polynomials; 05C85; 05C20; 68R10 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9735-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9735-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9735-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().