A LINEAR-TIME ALGORITHM TO COMPUTE A DOMINATING PATH IN AN AT-FREE GRAPH

被引：15

作者：

CORNEIL, DG

OLARIU, S

STEWART, L

机构：

[1] OLD DOMINION UNIV,DEPT COMP SCI,NORFOLK,VA 23529

[2] UNIV ALBERTA,DEPT COMP SCI,EDMONTON,AB,CANADA

来源：

INFORMATION PROCESSING LETTERS | 1995年 / 54卷 / 05期

基金：

美国国家科学基金会; 加拿大自然科学与工程研究理事会;

关键词：

ASTEROIDAL TRIPLE-FREE GRAPHS; DOMINATION; ALGORITHMS;

D O I：

10.1016/0020-0190(95)00021-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An independent set {x, y, z} is called an asteroidal triple if between any pair in the triple there exists a path that avoids the neighborhood of the third. A graph is referred to as AT-free if it does not contain an asteroidal triple. We present a simple linear-time algorithm to compute a dominating path in a connected AT-free graph.

引用

页码：253 / 257

页数：5

共 50 条

[1] A linear-time algorithm to compute a MAD tree of an interval graph
Dahlhaus, E
Dankelmann, P
Ravi, R
[J]. INFORMATION PROCESSING LETTERS, 2004, 89 (05) : 255 - 259
[2] A linear-time algorithm for minimum k-hop dominating set of a cactus graph
Abu-Affash, A. Karim
Carmi, Paz
Krasin, Adi
[J]. DISCRETE APPLIED MATHEMATICS, 2022, 320 : 488 - 499
[3] A LINEAR-TIME ALGORITHM TO COMPUTE THE RELIABILITY OF PLANAR CUBE-FREE NETWORKS
POLITOF, T
SATYANARAYANA, A
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1990, 39 (05) : 557 - 563
[4] AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION
BIXBY, RE
WAGNER, DK
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 99 - 123
[5] A linear-time algorithm to compute the triangular hull of a digital object
Sarkar, Apurba
Biswas, Arindam
Dutt, Mousumi
Bhowmick, Partha
Bhattacharya, Bhargab B.
[J]. DISCRETE APPLIED MATHEMATICS, 2017, 216 : 408 - 423
[6] Linear-time online algorithm for inferring the shortest path graph from a walk label
Narisada, Shintaro
Hendrian, Diptarama
Yoshinaka, Ryo
Shinohara, Ayumi
[J]. THEORETICAL COMPUTER SCIENCE, 2020, 812 : 187 - 202
[7] A linear-time algorithm for computing collision-free path on reconfigurable mesh
Wang, Dajin
[J]. PARALLEL COMPUTING, 2008, 34 (09) : 487 - 496
[8] A LINEAR-TIME ALGORITHM FOR PROPER INTERVAL GRAPH RECOGNITION
DEFIGUEIREDO, CMH
MEIDANIS, J
DEMELLO, CP
[J]. INFORMATION PROCESSING LETTERS, 1995, 56 (03) : 179 - 184
[9] A LINEAR-TIME ALGORITHM FOR DRAWING A PLANAR GRAPH ON A GRID
CHROBAK, M
PAYNE, TH
[J]. INFORMATION PROCESSING LETTERS, 1995, 54 (04) : 241 - 246
[10] A LINEAR-TIME ALGORITHM FOR FINDING A COMPLETE GRAPH MINOR IN A DENSE GRAPH
Dujmovic, Vida
Harvey, Daniel J.
Joret, Gwenael
Reed, Bruce
Wood, David R.
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 1770 - 1774

← 1 2 3 4 5 →