A note on locating a central vertex of a 3-cactus graph

Rex K. Kincaid; Oded Z. Maimon

doi:10.1016/0305-0548(90)90008-U

A note on locating a central vertex of a 3-cactus graph

Rex K. Kincaid^*, Oded Z. Maimon

^*Corresponding author for this work

Department of Industrial Engineering

College of William and Mary

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We extend linear time algorithms for a variety of vertex location measures on trees to include 3-cactus graphs. To do this the original 3-cactus graph is transformed into a tree. The behavior of median and variance measures under this transformation is studied and linear (in the number of vertices) time complexity algorithms for the minimum weighted vertex variance problem and the vertex restricted stochastic queue median are developed.

Original language	English
Pages (from-to)	315-320
Number of pages	6
Journal	Computers and Operations Research
Volume	17
Issue number	3
DOIs	https://doi.org/10.1016/0305-0548(90)90008-U
State	Published - 1990

Access to Document

10.1016/0305-0548(90)90008-U

Cite this

@article{a5c01732da5545ebaba1d8f13b65e7a2,

title = "A note on locating a central vertex of a 3-cactus graph",

abstract = "We extend linear time algorithms for a variety of vertex location measures on trees to include 3-cactus graphs. To do this the original 3-cactus graph is transformed into a tree. The behavior of median and variance measures under this transformation is studied and linear (in the number of vertices) time complexity algorithms for the minimum weighted vertex variance problem and the vertex restricted stochastic queue median are developed.",

author = "Kincaid, {Rex K.} and Maimon, {Oded Z.}",

year = "1990",

doi = "10.1016/0305-0548(90)90008-U",

language = "אנגלית",

volume = "17",

pages = "315--320",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "3",

}

TY - JOUR

T1 - A note on locating a central vertex of a 3-cactus graph

AU - Kincaid, Rex K.

AU - Maimon, Oded Z.

PY - 1990

Y1 - 1990

N2 - We extend linear time algorithms for a variety of vertex location measures on trees to include 3-cactus graphs. To do this the original 3-cactus graph is transformed into a tree. The behavior of median and variance measures under this transformation is studied and linear (in the number of vertices) time complexity algorithms for the minimum weighted vertex variance problem and the vertex restricted stochastic queue median are developed.

AB - We extend linear time algorithms for a variety of vertex location measures on trees to include 3-cactus graphs. To do this the original 3-cactus graph is transformed into a tree. The behavior of median and variance measures under this transformation is studied and linear (in the number of vertices) time complexity algorithms for the minimum weighted vertex variance problem and the vertex restricted stochastic queue median are developed.

UR - http://www.scopus.com/inward/record.url?scp=0025263382&partnerID=8YFLogxK

U2 - 10.1016/0305-0548(90)90008-U

DO - 10.1016/0305-0548(90)90008-U

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0025263382

SN - 0305-0548

VL - 17

SP - 315

EP - 320

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

A note on locating a central vertex of a 3-cactus graph

Abstract

Access to Document

Other files and links

Fingerprint

Cite this