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

Algorithms for coloring quadtrees

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

DOI10.1007/S00453-001-0054-2zbMath0995.68188arXivcs/9907030OpenAlexW2167757994MaRDI QIDQ5956834

No author found.

Publication date: 23 October 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9907030


zbMATH Keywords

graph coloringfour-color theoremquadtrees


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)


Related Items (3)

Coloring octrees ⋮ Some results of Christos Papadimitriou on internet structure, network routing, and web information ⋮ Efficient approximation algorithms for clustering point-sets







This page was built for publication: Algorithms for coloring quadtrees

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