"The Parameterized Complexity of the Induced Matching Problem in Planar Graphs."

Hannes Moser, Somnath Sikdar (2007)

Details and statistics

DOI: 10.1007/978-3-540-73814-5_32

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.