Pages that link to "Item:Q1024786"
From MaRDI portal
The following pages link to Minimum weakly fundamental cycle bases are hard to find (Q1024786):
Displaying 11 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Cycle-based cluster variational method for direct and inverse inference (Q330619) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) (Q1682895) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Rooted Cycle Bases (Q3449832) (← links)
- On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
