Simultaneous embeddings of graphs as median and antimedian subgraphs

DOI10.1002/net.20350zbMath1207.05037OpenAlexW4243403738MaRDI QIDQ3057170

No author found.

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://dyuthi.cusat.ac.in/purl/4203

zbMATH Keywords

facility location problemsconvex subgraphsmedian setsantimedian sets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Discrete location and assignment (90B80)

Related Items (3)

Convex median and anti-median at prescribed distance ⋮ The median problem on \(k\)-partite graphs ⋮ Axiomatic characterization of the median and antimedian function on a complete graph minus a matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding graphs as isometric medians
• Discrete facility location and routing of obnoxious activities.
• Conditional median: a parametric solution concept for location problems
• The median procedure in the semilattice of orders
• Locating two obnoxious facilities using the weighted maximin criterion
• Medians of arbitrary graphs
• Collection depots facility location problems in trees
• On graphs with prescribed median I

This page was built for publication: Simultaneous embeddings of graphs as median and antimedian subgraphs