SPACE COMPLEXITY: WHAT MAKES PLANAR GRAPHS SPECIAL?

被引:0
|
作者
Arvind, V. [1 ]
机构
[1] Inst Math Sci, CIT Campus,Taramani, Chennai 600113, Tamil Nadu, India
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:35 / 53
页数:19
相关论文
共 50 条
  • [1] Space complexity: What makes planar graphs special?
    Datta, S. (sdatta@cmi.ac.in), 1600, European Association for Theoretical Computer Science, C/O Ioannis Chatzigiannakis, 1 N. Kazantzaki Str.,Rio, 26504, Greece (109):
  • [2] Space Complexity of Optimization Problems in Planar Graphs
    Datta, Samir
    Kulkarni, Raghav
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 2014, 8402 : 300 - 311
  • [3] Neighborhood Complexity of Planar Graphs
    Joret, Gwenael
    Rambaud, Clement
    COMBINATORICA, 2024, 44 (05) : 1115 - 1148
  • [4] On the obfuscation complexity of planar graphs
    Verbitsky, Oleg
    THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 294 - 300
  • [5] The complexity of the Hajos calculus for planar graphs
    Iwama, Kazuo
    Seto, Kazuhisa
    Tamaki, Suguru
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 1182 - 1191
  • [6] Radiocoloring in planar graphs: Complexity and approximations
    Fotakis, DA
    Nikoletseas, SE
    Papadopoulou, VG
    Spirakis, PG
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (03) : 514 - 538
  • [7] The complexity of broadcasting in planar and decomposable graphs
    Jakoby, A
    Reischuk, R
    Schindelhauer, C
    DISCRETE APPLIED MATHEMATICS, 1998, 83 (1-3) : 179 - 206
  • [8] The complexity of the majority rule on planar graphs
    Goles, Eric
    Montealegre, Pedro
    ADVANCES IN APPLIED MATHEMATICS, 2015, 64 : 111 - 123
  • [9] What makes nanotechnologies special?
    Mehta, Michael D.
    Hunt, Geoffrey
    Nanotechnology: Risk, Ethics and Law, 2006, : 273 - 281
  • [10] What makes teaching special?
    Lee, VR
    Sherin, BL
    ICLS2004: INTERNATIONAL CONFERENCE OF THE LEARNING SCIENCES, PROCEEDINGS: EMBRACING DIVERSITY IN THE LEARNING SCIENCES, 2004, : 302 - 309