On the Complexity of the Dominating Induced Matching Problem in Hereditary Classes of Graphs

AuthID
 P-002-SFN
3
Author(s)
Tipo de Documento
Article
Year published
2011
Publicado
in DISCRETE APPLIED MATHEMATICS, ISSN: 0166-218X
Volume: 159, Número: 7, Páginas: 521-531 (11)
Indexing
Wos®
Scopus®
Crossref®18
Google Scholar®
Publication Identifiers
SCOPUS: 2-s2.0-79952188893
Wos: WOS:000288972200004
Source Identifiers
ISSN: 0166-218X
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service