Pages that link to "Item:Q633843"

The following pages link to New approximation algorithms for minimum cycle bases of graphs (Q633843):

Displaying 10 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)
• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
• New length bounds for cycle bases (Q2380021) (← 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)
• Automata, Languages and Programming (Q5466519) (← links)
• A direct method for calculating cell cycles of a block map of a simple planar graph (Q5871440) (← links)
• Approximation and Online Algorithms (Q5896929) (← links)
• Minimum cycle bases, faster and simpler (Q6486930) (← links)