The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

doi 10.1007/978-3-540-73814-5_32
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy