Pages that link to "Item:Q5896929"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5896929):
Displaying 15 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Classes of cycle bases (Q868389) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123) (← links)
- Sensor Network Localization on the Group of Three-Dimensional Displacements (Q3457100) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- (Q4289870) (← links)
- An improved heuristic for computing short integral cycle bases (Q5406185) (← links)
- (Q6060015) (← links)
