Finding perfect matching cuts faster (Q6182915)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7781745

Language	Label	Description	Also known as
English	Finding perfect matching cuts faster	scientific article; zbMATH DE number 7781745

Statements

scholarly article

0 references

Finding perfect matching cuts faster (English)

0 references

10.1007/978-3-031-34347-6_26

0 references

Neeldhara Misra

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

22 December 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

perfect matching cut

0 references

branch and bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-34347-6_26

0 references

0 references

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

0 references

Matching cut in graphs with large minimum degree

0 references

Recognizing decomposable graphs

0 references

Finding matching cuts in \(H\)-free graphs

0 references

Exact exponential algorithms.

0 references

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration

0 references

0 references

0 references

The perfect matching cut problem revisited

0 references

Algorithms for Vertex Partitioning Problems on Partial k-Trees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6182915

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6182915&oldid=37614575"