scientific article; zbMATH DE number 1953085

zbMATH Open1022.68091MaRDI QIDQ4414488FDOQ4414488

Authors: Simone Dantas, Celina M. H. de Figueiredo, Luerbio Faria 

Publication date: 25 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730092.htm

Title of this publication is not available (Why is that?)

Recommendations

• On decision and optimization (\(k\),\(l\))-graph sandwich problems
• On the forbidden induced subgraph sandwich problem
• On \((k,\ell )\)-graph sandwich problems
• scientific article; zbMATH DE number 6423755
• New results on chordal-(\(k, l\)) and strongly chordal-(\(k, l\)) sandwich problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (14)

• Title not available (Why is that?)
• Partitions and well-coveredness: the graph sandwich problem
• The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
• Complexity and algorithms for graph and hypergraph sandwich problems
• Title not available (Why is that?)
• The graph sandwich problem for 1-join composition is NP-complete
• On decision and optimization (\(k\),\(l\))-graph sandwich problems
• Complexity issues for the sandwich homogeneous set problem
• The chain graph sandwich problem
• New results on chordal-(\(k, l\)) and strongly chordal-(\(k, l\)) sandwich problems
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
• Title not available (Why is that?)
• On \((k,\ell )\)-graph sandwich problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414488)