Pages that link to "Item:Q1041731"
From MaRDI portal
The following pages link to A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731):
Displaying 15 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Classes of cycle bases (Q868389) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- A cycle-based formulation for the distance geometry problem (Q2056892) (← links)
- An efficient algorithm for 1-dimensional (Persistent) path homology (Q2105324) (← links)
- Cycle analysis of directed acyclic graphs (Q2128678) (← links)
- Minimum cycle bases of graphs over different fields (Q3439388) (← links)
- On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. (Q5240221) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
