Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model

被引：0
|
作者：
Blaesius, Thomas [1 ]
Brueckner, Guido [1 ]
Rutter, Ignaz [1 ]
机构：
[1] Karlsruhe Inst Technol, Fac Informat, D-76021 Karlsruhe, Germany
来源：
ALGORITHMS - ESA 2014 | 2014年 / 8737卷
关键词：
MINIMUM NUMBER;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that finding orthogonal grid embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (allowing vertices of degree > 4) is NP-complete, thus solving a long-standing open problem. On the positive side, we give an efficient algorithm for several restricted variants, such as graphs of bounded branch width and a subexponential exact algorithm for general plane graphs.
引用
收藏
页码：161 / 172
页数：12
相关论文
共 50 条
  • [41] Taylor series based finite difference approximations of higher-degree derivatives
    Khan, IR
    Ohba, R
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2003, 154 (01) : 115 - 124
  • [42] Source finiteness and rupture propagation using higher-degree moment tensors
    Li, Juan
    He, Yu-Mei
    Yao, Zhen-Xing
    BULLETIN OF THE SEISMOLOGICAL SOCIETY OF AMERICA, 2006, 96 (04) : 1241 - 1256
  • [43] Some Higher-Degree Lacunary Fractional Splines in the Approximation of Fractional Differential Equations
    Srivastava, Hari Mohan
    Mohammed, Pshtiwan Othman
    Guirao, Juan L. G.
    Hamed, Y. S.
    SYMMETRY-BASEL, 2021, 13 (03):
  • [44] The Complexity of Degree Anonymization by Graph Contractions
    Hartung, Sepp
    Talmon, Nimrod
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2015), 2015, 9076 : 260 - 271
  • [45] The complexity of degree anonymization by graph contractions
    Talmon, Nimrod
    Hartung, Sepp
    INFORMATION AND COMPUTATION, 2017, 256 : 212 - 225
  • [46] Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding
    Tang, Yun
    Huang, Jing
    Wang, Guangtao
    He, Xiaodong
    Zhou, Bowen
    58TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2020), 2020, : 2713 - 2722
  • [47] Polytopal Graph Complexity, Matrix Permanents, and Embedding
    Escolano, Francisco
    Hancock, Edwin R.
    Lozano, Miguel A.
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 2008, 5342 : 237 - +
  • [48] Distribution of Limit Cycles for A Class of Higher-Degree Degenerate Plane Polynomial System
    Gao, Jie
    PROCEEDINGS OF THE 7TH CONFERENCE ON BIOLOGICAL DYNAMIC SYSTEM AND STABILITY OF DIFFERENTIAL EQUATION, VOLS I AND II, 2010, : 598 - 601
  • [49] HIGHER-DEGREE MOMENT TENSORS - THE IMPORTANCE OF SOURCE FINITENESS AND RUPTURE PROPAGATION ON SEISMOGRAMS
    STUMP, BW
    JOHNSON, LR
    GEOPHYSICAL JOURNAL OF THE ROYAL ASTRONOMICAL SOCIETY, 1982, 69 (03): : 721 - 743
  • [50] The use of higher-degree polynomials for trajectory planning with jerk, acceleration and velocity constraints
    Boryga, Marek
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2020, 63 (04) : 337 - 347
12345