SPACE COMPLEXITY: WHAT MAKES PLANAR GRAPHS SPECIAL?

被引：0
|
作者：
Arvind, V. [1 ]
机构：
[1] Inst Math Sci, CIT Campus,Taramani, Chennai 600113, Tamil Nadu, India
来源：
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | 2013年 / 109期
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：35 / 53
页数：19
相关论文
共 50 条
  • [41] What makes space activities commercial?
    Davidian, Ken
    ACTA ASTRONAUTICA, 2021, 182 : 547 - 558
  • [42] What makes a therapeutic healthcare space?
    Hellyer P.
    British Dental Journal, 2019, 226 (9) : 666 - 666
  • [43] On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
    Sun, Lin
    Yu, Guanglong
    Wu, Jianliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (03)
  • [44] On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
    Lin Sun
    Guanglong Yu
    Jianliang Wu
    Journal of Combinatorial Optimization, 2024, 47
  • [45] On the complexity of role colouring planar graphs, trees and cographs
    Purcell, Christopher
    Rombach, Puck
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 35 : 1 - 8
  • [46] The parameterized complexity of the induced matching problem in planar graphs
    Moser, Hannes
    Sikdar, Somnath
    FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 325 - +
  • [47] The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
    Blaeser, Markus
    Curticapean, Radu
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 96 - 107
  • [48] Complexity of paired domination in AT-free and planar graphs
    Tripathi, Vikash
    Kloks, Ton
    Pandey, Arti
    Paul, Kaustav
    Wang, Hung-Lung
    arXiv, 2021,
  • [49] The complexity of pebbling reachability and solvability in planar and outerplanar graphs
    Lewis, Timothy
    Cusack, Charles A.
    Dion, Lisa
    DISCRETE APPLIED MATHEMATICS, 2014, 172 : 62 - 74
  • [50] Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
    Hansen, Kristoffer Arnsfelt
    Komarath, Balagopal
    Sarma, Jayalal
    Skyum, Sven
    Talebanfard, Navid
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 336 - 347
12345