The Subset Partial Order: Computing and Combinatorics

DOI10.1137/1.9781611973006.4zbMath1430.68198OpenAlexW2399633683MaRDI QIDQ5194675

Amr Elmasry

Publication date: 16 September 2019

Published in: 2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973006.4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Best match graphs ⋮ On the size of the subset partial order ⋮ Into the square: on the complexity of some quadratic-time solvable problems

This page was built for publication: The Subset Partial Order: Computing and Combinatorics