Computing the fully optimal spanning tree of an ordered bipolar directed graph
Work
Year: 2024
Type: article
Abstract: It was previously shown by the authors that a directed graph on a linearly ordered set of edges (ordered graph) with adjacent unique source and sink (bipolar digraph) has a unique fully optimal spanni... more
Source: Discrete Mathematics
Authors Emeric Gioan, Michel Las Vergnas
Institutions Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, Université de Montpellier, Centre National de la Recherche Scientifique
Cites: 13
Cited by: 2
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $3,000