Pages that link to "Item:Q3439123"
From MaRDI portal
The following pages link to Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123):
Displaying 10 items.
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Sensor Network Localization on the Group of Three-Dimensional Displacements (Q3457100) (← links)
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs (Q3569834) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph (Q4306913) (← links)
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph (Q5301401) (← links)
- (Q6060015) (← links)