On the enumeration of minimal non-pairwise compatibility graphs

DOI10.1007/978-3-030-58150-3_30OpenAlexW3082378232MaRDI QIDQ5918254

Hiroshi Nagamochi, Aleksandar Shurbevski, Naveed Ahmed Azam

Publication date: 21 April 2021

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

Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_30

zbMATH Keywords

branch-and-bound algorithmlinear programmingpairwise compatibility graph

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

On the enumeration of minimal non-pairwise compatibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Two-round multiparty secure computation from minimal assumptions
• How to construct constant-round zero-knowledge proof systems for NP
• Exploring pairwise compatibility graphs
• A method for enumerating pairwise compatibility graphs with a given number of vertices
• Some classes of graphs that are not PCGs
• Some reduction operations to pairwise compatibility graphs
• Practical graph isomorphism. II.
• On graphs that are not PCGs
• DISCOVERING PAIRWISE COMPATIBILITY GRAPHS
• Pairwise Compatibility Graphs: A Survey
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• On the Composition of Zero-Knowledge Proof Systems
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Constant round non-malleable protocols using one way functions
• The Exact Round Complexity of Secure Computation
• Two Round Multiparty Computation via Multi-key FHE
• Round-optimal secure multi-party computation

This page was built for publication: On the enumeration of minimal non-pairwise compatibility graphs