Parameterized results on acyclic matchings with implications for related problems
J Chaudhary, M Zehavi - Journal of Computer and System Sciences, 2025 - Elsevier
A matching M in a graph G is an acyclic matching if the subgraph of G induced by the
endpoints of the edges of M is a forest. Given a graph G and ℓ∈ N, Acyclic Matching asks …
endpoints of the edges of M is a forest. Given a graph G and ℓ∈ N, Acyclic Matching asks …
-matchings parameterized by treewidth
J Chaudhary, M Zehavi - … Workshop on Graph-Theoretic Concepts in …, 2023 - Springer
A matching is a subset of edges in a graph G that do not share an endpoint. A matching M is
a-matching if the subgraph of G induced by the endpoints of the edges of M satisfies …
a-matching if the subgraph of G induced by the endpoints of the edges of M satisfies …
Minimum maximal acyclic matching in proper interval graphs
J Chaudhary, S Mishra, BS Panda - Discrete Applied Mathematics, 2025 - Elsevier
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in
G of minimum cardinality such that the set of M-saturated vertices induces an acyclic …
G of minimum cardinality such that the set of M-saturated vertices induces an acyclic …
Acyclic matching on hypercube networks
S Saffren, D Angel - 2022 Third International Conference on …, 2022 - ieeexplore.ieee.org
Tracing cells and electrons in network graphs which is often used in chemical industries, life
science branches, cybersecurity and so on. It will be more applicable if the acyclic matching …
science branches, cybersecurity and so on. It will be more applicable if the acyclic matching …