English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs

Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2014). Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica, 70(3), 513-560. doi:10.1007/s00453-014-9877-5.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3AB2-6 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-3AB3-4
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hermelin, Danny1, Author           
Mnich, Matthias2, Author
van Leeuwen, Erik Jan1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: Algorithms and data structures Induced matchings Claw-free graphs Fixed-parameter tractability
 Abstract: -

Details

show
hide
Language(s): eng - English
 Dates: 20142014
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/s00453-014-9877-5
BibTex Citekey: HermelinMnichLeeuwen2014
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York : Springer
Pages: - Volume / Issue: 70 (3) Sequence Number: - Start / End Page: 513 - 560 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793