The following pages link to STACS 2005 (Q5710716):
Displaying 18 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- A polynomial bound on the number of light cycles in an undirected graph (Q674176) (← links)
- Classes of cycle bases (Q868389) (← links)
- Algorithms for shortest paths and \(d\)-cycle problems (Q876687) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← 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)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Algorithms to compute minimum cycle basis in directed graphs (Q2643144) (← links)
- (Q3140457) (← links)
- Minimum path bases and relevant paths (Q3367052) (← links)
- Minimum cycle bases of graphs over different fields (Q3439388) (← links)
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs (Q3569834) (← links)
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph (Q4306913) (← links)
- Circuit bases of strongly connected digraphs (Q4823306) (← links)
- (Q5111456) (← links)
- Automata, Languages and Programming (Q5716781) (← links)
