Heuristic algorithms for the min-max edge 2-coloring problem
From MaRDI portal
Publication:1791033
DOI10.1007/978-3-319-94776-1_55OpenAlexW2810697814MaRDI QIDQ1791033
Publication date: 4 October 2018
Full work available at URL: https://arxiv.org/abs/1801.02239
Analysis of algorithms (68W40) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computer system organization (68Mxx)
This page was built for publication: Heuristic algorithms for the min-max edge 2-coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791033)