Pages that link to "Item:Q629358"

The following pages link to On the approximability of the minimum strictly fundamental cycle basis problem (Q629358):

Displaying 11 items.

• Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
• Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
• Minimum cut bases in undirected networks (Q968141) (← links)
• Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
• Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
• On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
• New length bounds for cycle bases (Q2380021) (← links)
• (Q4289870) (← links)
• The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices (Q4764873) (← links)
• Approximation and Online Algorithms (Q5896929) (← links)