A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs

Documenti analoghi

• On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
  di: Ghanbari, Babak, et al.
  Pubblicazione: (2025)
• A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
  di: Shakeri, Heman, et al.
  Pubblicazione: (2025)
• A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
  di: Bourneuf, Romain, et al.
  Pubblicazione: (2025)
• Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
  di: Hellmuth, Marc, et al.
  Pubblicazione: (2023)
• A Polynomial-Time Approximation Algorithm for Complete Interval Minors
  di: Bourneuf, Romain, et al.
  Pubblicazione: (2025)