How to get a degree-anonymous graph using minimum number of edge rotations

DOI10.1007/978-3-030-64843-5_17MaRDI QIDQ2692217zbMATH OpenOpenAlexFDO

Authors Cristina Bazgan, Pierre Cazals, Janka Chlebíková

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64843-5_17

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

This page was built for publication: How to get a degree-anonymous graph using minimum number of edge rotations

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