Independent domination in chordal graphs Export

@article{citeulike:571564, abstract = {A graph chordal if it does not contain any cycle of length greater than three as an induced subgraph. A set of S of vertices of a graph G = (V,E) is independent if not two vertices in S are adjacent, and is dominating if every vertex in V-S is adjacent to some vertex in S. We present a linear algorithm to locate a minimum weight independent dominating set in a chordal graph with 0-1 vertex weights.}, author = {Farber, Martin}, citeulike-article-id = {571564}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/0167-6377(82)90015-3}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V8M-48N542P-H/2/9ce045127dece5d4e19ade219efebead}, doi = {10.1016/0167-6377(82)90015-3}, journal = {Operations Research Letters}, keywords = {algorithms, chordal\_graphs, graph\_theory}, month = {September}, number = {4}, pages = {134--138}, posted-at = {2006-10-25 00:41:28}, priority = {2}, title = {Independent domination in chordal graphs}, url = {http://dx.doi.org/10.1016/0167-6377(82)90015-3}, volume = {1}, year = {1982} }

TY - JOUR ID - citeulike:571564 L3 - citeulike-article-id:571564 N2 - A graph chordal if it does not contain any cycle of length greater than three as an induced subgraph. A set of S of vertices of a graph G = (V,E) is independent if not two vertices in S are adjacent, and is dominating if every vertex in V-S is adjacent to some vertex in S. We present a linear algorithm to locate a minimum weight independent dominating set in a chordal graph with 0-1 vertex weights. IS - 4 JF - Operations Research Letters EP - 138 TI - Independent domination in chordal graphs VL - 1 SP - 134 KW - algorithms KW - chordal_graphs KW - graph_theory AU - Farber, Martin PY - 1982/09// UR - http://dx.doi.org/10.1016/0167-6377(82)90015-3 ER -