Parallel complexity of partitioning a planar graph into vertex-induced forests

被引：11
|
作者：
Chen, ZZ [1 ]
He, X [1 ]
机构：
[1] SUNY BUFFALO,DEPT COMP SCI,BUFFALO,NY 14260
来源：
DISCRETE APPLIED MATHEMATICS | 1996年 / 69卷 / 1-2期
关键词：
D O I：
10.1016/0166-218X(96)00089-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We present the first NC algorithm for partitioning the vertex set of a given planar graph into three subsets, each of which induces a forest. The algorithm runs in O(log n log* n) time using O(n/(log n log*n)) processors on an EREW PRAM. We also present optimal NC algorithms for partitioning the vertex set of a given K-4-free or K-2,K-3-free graph (special planar graph) into two subsets, each of which induces a forest.
引用
收藏
页码：183 / 198
页数：16
相关论文
共 50 条
  • [1] On vertex-induced weighted Turan problems
    Xu, Zixiang
    Jing, Yifan
    Ge, Gennian
    DISCRETE MATHEMATICS, 2022, 345 (01)
  • [2] Partitioning edges of a planar graph into linear forests and a matching
    Bonamy, Marthe
    Czyzewska, Jadwiga
    Kowalik, Lukasz
    Pilipczuk, Michal
    JOURNAL OF GRAPH THEORY, 2023, 104 (03) : 659 - 677
  • [3] USING EDGE-INDUCED AND VERTEX-INDUCED SUBHYPERGRAPH POLYNOMIALS
    Tadesse, Yohannes
    MATHEMATICA SCANDINAVICA, 2015, 117 (02) : 161 - 169
  • [4] Vertex separators for partitioning a graph
    Evrendilek, Cem
    SENSORS, 2008, 8 (02) : 635 - 657
  • [5] Characterizing block graphs in terms of their vertex-induced partitions
    Dress, Andreas
    Huber, Katharina T.
    Koolen, Jacobus
    Moulton, Vincent
    Spillner, Andreas
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2016, 66 : 1 - 9
  • [6] Inserting a Vertex into a Planar Graph
    Chimani, Markus
    Gutwenger, Carsten
    Mutzel, Petra
    Wolf, Christian
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 375 - 383
  • [7] PARTITIONING PLANAR GRAPH OF GIRTH 5 INTO TWO FORESTS WITH MAXIMUM DEGREE 4
    Chen, Min
    Raspaud, Andre
    Wang, Weifan
    Yu, Weiqiang
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2024, 74 (02) : 355 - 366
  • [8] Partitioning a planar graph without chordal 5-cycles into two forests
    Wang, Yang
    Wang, Weifan
    Kong, Jiangxu
    Wang, Yiqiao
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2024, 74 (02) : 377 - 388
  • [9] EFFICIENT GRAPH AUTOMORPHISM BY VERTEX PARTITIONING
    FOWLER, G
    HARALICK, R
    GRAY, FG
    FEUSTEL, C
    GRINSTEAD, C
    ARTIFICIAL INTELLIGENCE, 1983, 21 (1-2) : 245 - 269
  • [10] Maximum density of vertex-induced perfect cycles and paths in the hypercube
    Goldwasser, John
    Hansen, Ryan
    DISCRETE MATHEMATICS, 2021, 344 (11)
12345