EXTENDING PLANAR GRAPH ALGORITHMS TO K3,3-FREE GRAPHS

被引：0

|

作者：

KHULLER, S

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 338卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：67 / 79

页数：13

相关论文

共 50 条

[1] EXTENDING PLANAR GRAPH ALGORITHMS TO K3,3-FREE GRAPHS
KHULLER, S
INFORMATION AND COMPUTATION, 1990, 84 (01) : 13 - 25
[2] K3,3-free intersection graphs of finite groups
Kayacan, Selcuk
COMMUNICATIONS IN ALGEBRA, 2017, 45 (06) : 2466 - 2477
[3] Upper bounds on distance measures in K3,3-free graphs
Dankelmann, P
Dlamini, G
Swart, HC
UTILITAS MATHEMATICA, 2005, 67 : 205 - 221
[4] NC ALGORITHMS FOR COMPUTING THE NUMBER OF PERFECT MATCHINGS IN K3,3-FREE GRAPHS AND RELATED PROBLEMS
VAZIRANI, VV
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 233 - 242
[5] NC ALGORITHMS FOR COMPUTING THE NUMBER OF PERFECT MATCHINGS IN K3,3-FREE GRAPHS AND RELATED PROBLEMS
VAZIRANI, VV
INFORMATION AND COMPUTATION, 1989, 80 (02) : 152 - 164
[6] Reachability in K3,3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
Thierauf, Thomas
Wagner, Fabian
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2009, 5699 : 323 - +
[7] Derandomizing Isolation Lemma for K3,3-free and K5 -free Bipartite Graphs
Arora, Rahul
Gupta, Ashu
Gurjar, Rohit
Tewari, Raghunath
33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
[8] Efficient approximation schemes for maximization problems on K3,3-free or K5-free graphs
Chen, ZZ
JOURNAL OF ALGORITHMS, 1998, 26 (01) : 166 - 187
[9] Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application
Chen, ZZ
Zhang, SQ
INFORMATION PROCESSING LETTERS, 2002, 84 (03) : 141 - 145
[10] The structure of K3,3-subdivision-free toroidal graphs
Gagarin, Andrei
Labelle, Gilbert
Leroux, Pierre
DISCRETE MATHEMATICS, 2007, 307 (23) : 2993 - 3005

← 1 2 3 4 5 →