Pages that link to "Item:Q5466519"

The following pages link to Automata, Languages and Programming (Q5466519):

Displaying 22 items.

• Matrix sparsification and the sparse null space problem (Q329287) (← links)
• Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
• Cycle bases of graphs and sampled manifolds (Q733440) (← links)
• Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
• Classes of cycle bases (Q868389) (← links)
• Minimum cut bases in undirected networks (Q968141) (← links)
• Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
• Integral cycle bases for cyclic timetabling (Q1013300) (← 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)
• Length bounds for cycle bases of graphs (Q1625491) (← links)
• Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
• New length bounds for cycle bases (Q2380021) (← links)
• Minimum cycle bases of graphs on surfaces (Q2461194) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• Minimum path bases and relevant paths (Q3367052) (← links)
• On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
• Minimum Cycle Bases and Their Applications (Q3637310) (← links)
• A Faster Algorithm to Update Betweenness Centrality After Node Alteration (Q4985797) (← links)
• Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
• Computing cyclic invariants for molecular graphs (Q6496347) (← links)