The complexity of finding supergraphs

DOI10.1007/978-3-031-36978-0_15MaRDI QIDQ6149042zbMATH OpenFDO

Authors Vittorio Cipriani, Arno Pauly

Publication date 12 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• On Halin subgraphs and supergraphs
• scientific article; zbMATH DE number 3910446
• On the complexity of the maximum subgraph problem

Cites work

• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Degrees of bi-embeddable categoricity
• Degrees of bi-embeddable categoricity of equivalence structures
• Infinite versions of some problems from finite complexity theory
• On the algebraic structure of Weihrauch degrees
• Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Weihrauch Complexity in Computable Analysis

This page was built for publication: The complexity of finding supergraphs

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