A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS

被引：0

|

作者：

JAMISON, B

OLARIU, S

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 405卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：1 / 19

页数：19

相关论文

共 50 条

[1] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
JAMISON, B
OLARIU, S
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 329 - 344
[2] A LINEAR-TIME RECOGNITION ALGORITHM FOR P-4-REDUCIBLE GRAPHS
JAMISON, B
OLARIU, S
[J]. FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE ////, 1989, 405 : 1 - 19
[3] On extended P-4-reducible and extended P-4-sparse graphs
Giakoumakis, V
Vanherpe, JM
[J]. THEORETICAL COMPUTER SCIENCE, 1997, 180 (1-2) : 269 - 286
[4] Linear-Time Recognition of Probe Interval Graphs
McConnell, Ross M.
Nussbaum, Yahav
[J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 349 - +
[5] LINEAR-TIME RECOGNITION OF PROBE INTERVAL GRAPHS
Mcconnell, Ross M.
Nussbaum, Yahav
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2006 - 2046
[6] A SIMPLE LINEAR-TIME ALGORITHM FOR THE RECOGNITION OF BANDWIDTH-2 BICONNECTED GRAPHS
MAKEDON, F
SHEINWALD, D
WOLFSTHAL, Y
[J]. INFORMATION PROCESSING LETTERS, 1993, 46 (02) : 103 - 107
[7] A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
Nikolopoulos, Stavros D.
Papadopoulos, Charis
[J]. GRAPHS AND COMBINATORICS, 2011, 27 (04) : 557 - 565
[8] A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
Stavros D. Nikolopoulos
Charis Papadopoulos
[J]. Graphs and Combinatorics, 2011, 27 : 557 - 565
[9] SOME RESULTS ON THE RECONSTRUCTION PROBLEMS - P-CLAW-FREE, CHORDAL, AND P-4-REDUCIBLE GRAPHS
THATTE, BD
[J]. JOURNAL OF GRAPH THEORY, 1995, 19 (04) : 549 - 561
[10] Linear-time recognition of map graphs with outerplanar witness
Mnich, Matthias
Rutter, Ignaz
Schmidt, Jens M.
[J]. DISCRETE OPTIMIZATION, 2018, 28 : 63 - 77

← 1 2 3 4 5 →