LOWER BOUNDS FOR SOLVING UNDIRECTED GRAPH PROBLEMS ON VLSI

被引：0
|
作者：
HAMBRUSCH, SE [1 ]
SIMON, J [1 ]
机构：
[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1983年 / 154卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：292 / 303
页数：12
相关论文
共 50 条
  • [1] SOLVING UNDIRECTED GRAPH PROBLEMS ON VLSI
    HAMBRUSCH, SE
    SIMON, J
    [J]. SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 527 - 544
  • [2] SOLVING GRAPH PROBLEMS ON VLSI MODELS
    DJIDJEV, HN
    [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1985, 38 (12): : 1623 - 1625
  • [3] A FRAMEWORK FOR SOLVING VLSI GRAPH LAYOUT PROBLEMS
    BHATT, SN
    LEIGHTON, FT
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) : 300 - 343
  • [4] Tight Lower Bounds on Graph Embedding Problems
    Cygan, Marek
    Fomin, Fedor V.
    Golovnev, Alexander
    Kulikov, Alexander S.
    Mihajlin, Ivan
    Pachocki, Jakub
    Socala, Arkadiusz
    [J]. JOURNAL OF THE ACM, 2017, 64 (03)
  • [5] Space Lower Bounds for Graph Stream Problems
    Verma, Paritosh
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2019, 2019, 11436 : 635 - 646
  • [6] Improved Lower Bounds for Graph Embedding Problems
    Bodlaender, Hans L.
    van der Zanden, Tom C.
    [J]. ALGORITHMS AND COMPLEXITY (CIAC 2017), 2017, 10236 : 92 - 103
  • [7] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    [J]. VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
  • [8] An Invitation to Dynamic Graph Problems: Lower Bounds - III
    Kashyop, Manas Jyoti
    Narayanaswamy, N. S.
    [J]. RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2022, 27 (10): : 1777 - 1787
  • [9] Upper and Lower Bounds for Fully Retroactive Graph Problems
    Henzinger, Monika
    Wu, Xiaowei
    [J]. ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 471 - 484
  • [10] An Invitation to Dynamic Graph Problems: Lower Bounds — III
    Manas Jyoti Kashyop
    N. S. Narayanaswamy
    [J]. Resonance, 2022, 27 : 1777 - 1787
12345