Journal article
Locating an absolute center on graphs that are almost trees
European journal of operational research, Vol.44(3), pp.357-372
02/15/1990
DOI: 10.1016/0377-2217(90)90247-9
Abstract
Physical models that exhibit a treelike graph structure frequently arise in telecommunication networks, interstate highway systems, and computer communication networks. Treelike graphs are characterized and properties related to the absolute center problem are analyzed that are preserved under two transformations of the graph. Utilizing these preserved properties, a linear time algorithm is presented for the absolute center problem whenever the underlying graph is homeomorphic to a treelike 3-cactus graph.
Details
- Title: Subtitle
- Locating an absolute center on graphs that are almost trees
- Creators
- Rex K. Kincaid - William & MaryTimothy J. Lowe - University of Iowa
- Resource Type
- Journal article
- Publication Details
- European journal of operational research, Vol.44(3), pp.357-372
- DOI
- 10.1016/0377-2217(90)90247-9
- ISSN
- 0377-2217
- eISSN
- 1872-6860
- Publisher
- Elsevier B.V
- Number of pages
- 16
- Language
- English
- Date published
- 02/15/1990
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963106602771
Metrics
1 Record Views