The simultaneous representation problem for chordal, comparability and permutation graphs

被引：0
|
作者：
Dept. of Mathematics and Statistics, Univ. of Guelph, Canada [1 ]
不详 [2 ]
机构：
来源：
J. Graph Algorithms and Appl. | / 2卷 / 283-315期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
相关论文
共 13 条
  • [1] Edge clique graphs and some classes of chordal graphs
    Discrete Math, 1-3 (31-39):
  • [2] Approximating interval coloring and max-coloring in chordal graphs
    Pemmaraju, Sriram V.
    Penumatcha, Sriram
    Raman, Rajiv
    Lect. Notes Comput. Sci., 1600, (399-416):
  • [3] On visibility representation of plane graphs
    Zhang, Huaming
    He, Xin
    Lect. Notes Comput. Sci., 1600, (477-488):
  • [4] The representation of solution of discrete process problem
    Yoshifuku, Isami
    1600, Society of Chemical Engineers, Japan (05):
  • [5] The online graph exploration problem on restricted graphs
    Kyoto University, Kyoto-shi, 606-8501, Japan
    IEICE Trans Inf Syst, 9 (1620-1627):
  • [6] Approximating the longest cycle problem on graphs with bounded degree
    Chen, Guantao
    Gao, Zhicheng
    Yu, Xingxing
    Zang, Wenan
    Lect. Notes Comput. Sci., (870-884):
  • [7] MGMAE: Molecular Representation Learning by Reconstructing Heterogeneous Graphs with A High Mask Ratio
    Feng, Jinjia
    Wang, Zhen
    Li, Yaliang
    Ding, Bolin
    Wei, Zhewei
    Xu, Hongteng
    International Conference on Information and Knowledge Management, Proceedings, 2022, : 509 - 519
  • [8] LEVEL REPRESENTATION OF A GRAPH IN A SINGLE LAYER ROUTING PROBLEM.
    Szepieniec, A.A.
    Delft Progress Report, 1979, 4 (04): : 252 - 265
  • [9] Hardness and Approximation for the Star β -Hub Routing Cost Problem in Δβ -Metric Graphs
    Tsai, Meng-Shiou
    Hsieh, Sun-Yuan
    Hung, Ling-Ju
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14422 LNCS : 97 - 111
  • [10] MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC.
    Grigoriev, Dima Yu
    Karpinski, Marek
    Annual Symposium on Foundations of Computer Science (Proceedings), 1987, : 166 - 171
12