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

scientific article

From MaRDI portal
Jump to:navigation, search

zbMath1054.68576MaRDI QIDQ3043700

Michael T. Hallett, Catherine McCartin, Frances A. Rosamond, Vida Dujmović, Matthew Suderman, Giuseppe Liotta, Naomi Nishimura, David R. Wood, Matthew Kitching, Michael R. Fellows, Prabhakar Ragde, S. H. Whitesides

Publication date: 6 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2265/22650001.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

A top-down approach to search-trees: Improved algorithmics for 3-hitting set, On the parameterized complexity of layered graph drawing, A new neural network algorithm for planarization problems, On the planarization of wireless sensor networks, Parameterized algorithmics for linear arrangement problems



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