Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximating the Max Edge-Coloring Problem

From MaRDI portal
Publication:3651536
Jump to:navigation, search

DOI10.1007/978-3-642-10217-2_11zbMath1267.05112OpenAlexW2150018078MaRDI QIDQ3651536

Ioannis Milis, Giorgio Lucarelli, Vangelis Th. Paschos, Nicolas Bourgeois

Publication date: 11 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_11



Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)


Related Items (1)

Approximating the max-edge-coloring problem







This page was built for publication: Approximating the Max Edge-Coloring Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3651536&oldid=17104071"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 06:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki