Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Complexity of the network median problem on planar grids

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

zbMath0848.05057MaRDI QIDQ1920126

A. A. Ageev

Publication date: 20 August 1996

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)




zbMATH Keywords

planar grid\(n\)-gridnetwork median problem


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (1)

Are there any good digraph width measures?







This page was built for publication: Complexity of the network median problem on planar grids

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1920126&oldid=14346169"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 14:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki