algorithms-optimization / Graph algorithms
On the basis of experiments up to 5000 nodes, Papamanthou and Tollis conjectured a relation between the longest paths produced by their MaxSTN and MinSTN algorithms for $st$-orientations of biconnected graphs. A counterexample refutes it.
Temporal state
No reconciled state yet.
Append-only history
On the basis of experiments up to 5000 nodes, Papamanthou and Tollis conjectured a relation between the longest paths produced by their MaxSTN and MinSTN algorithms for $st$-orientations of biconnected graphs. A counterexample refutes it.
Research memory
On the basis of experiments up to 5000 nodes, Papamanthou and Tollis conjectured a relation between the longest paths produced by their MaxSTN and MinSTN algorithms for $st$-orientations of biconnected graphs. A counterexample refutes it.
Evidence graph
No public relationships recorded yet.