End-vertices of AT-free bigraphs
From MaRDI portal
Publication:2019435
DOI10.1007/978-3-030-58150-3_5OpenAlexW3082397916MaRDI QIDQ2019435FDOQ2019435
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_5
breadth-first searchdepth-first searchbipartite permutation graphproper interval bigraphlexicographic breadth-first searchAT-free bigraphend-vertex problemmaximal neighbourhood search
Cited In (1)
This page was built for publication: End-vertices of AT-free bigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019435)