Linear time algorithms on mirror trees

Alain Quilliot () and Djamal Rebaine ()
Additional contact information
Alain Quilliot: Université Clermont Auvergne
Djamal Rebaine: Université du Québec à Chicoutimi

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 15, 3495-3519

Abstract: Abstract We address in this paper two problems on mirror graphs. The first is the recognition problem. While it is graph isomorphism complete, we show the analogous problem of recognizing mirror trees is solvable in linear time. The second problem we are tackling in this study is the linear ordering problem on mirror trees with respect to Directed Sum-Cut cost criterion for which a linear time algorithm is exhibited.

Keywords: Mirror graphs; Mirror trees; Directed sum-cut; Linear ordering; Linear time complexity (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00900-y 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:44:y:2022:i:5:d:10.1007_s10878-022-00900-y

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

DOI: 10.1007/s10878-022-00900-y

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 ().