A new graph parameter to measure linearity

DOI10.1007/978-3-319-71147-8_11MaRDI QIDQ6827649zbMATH OpenFDO

Authors Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr

Publication date 26 March 2018

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

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_11

zbMATH Keywords

asteroidal numbergraph classesgraph parameterlexbfslexcyclelexicographic breadth first searchlinear structuremulti-sweep algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: A new graph parameter to measure linearity

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