Pages that link to "Item:Q3569834"
From MaRDI portal
The following pages link to Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs (Q3569834):
Displaying 18 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
- Minimum cycle bases for network graphs (Q1882477) (← links)
- Rooted Cycle Bases (Q3449832) (← 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)
- Experimental and Efficient Algorithms (Q5710059) (← links)
- Automata, Languages and Programming (Q5716781) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- (Q6060015) (← links)
- Toward fast calculation of communication paths for resilient routing (Q6496360) (← links)
