k-separator chordal graphs: leafage and subfamilies

被引：0
|
作者：
Markenzon, Lilian [1 ]
da Costa Pereira, Paulo Renato [2 ]
Waga, Christina F. E. M. [3 ]
机构：
[1] Univ Fed Rio de Janeiro, NCE, Rio De Janeiro, Brazil
[2] Dept Policia Fed, Brasilia, DF, Brazil
[3] Univ Estado Rio de Janeiro, IME, BR-20550011 Rio De Janeiro, Brazil
来源：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2013年 / 20卷 / 05期
关键词：
chordal graph; minimal vertex separator; leafage; k-sep chordal graph; k-caterpillar; MINIMAL VERTEX SEPARATORS; TIME ALGORITHM; SUBCLASSES; TREES;
D O I：
10.1111/j.1475-3995.2012.00875.x
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The leafage of a chordal graph G is the minimum number of leaves among the clique-trees of G. In this paper, based on properties of the minimal vertex separators, the leafage of a k-separator chordal graph is determined in linear time. This result allows establishment of the relationship of some subfamilies of chordal graphs, such as k-trees, interval and uniquely representable chordal graphs.
引用
收藏
页码：681 / 688
页数：8
相关论文
共 50 条
  • [1] The vertex leafage of chordal graphs
    Chaplick, Steven
    Stacho, Juraj
    DISCRETE APPLIED MATHEMATICS, 2014, 168 : 14 - 25
  • [2] Domination and Cut Problems on Chordal Graphs with Bounded Leafage
    Galby, Esther
    Marx, Daniel
    Schepper, Philipp
    Sharma, Roohani
    Tale, Prafullkumar
    ALGORITHMICA, 2024, 86 (05) : 1428 - 1474
  • [3] Polynomial-Time Algorithm for the Leafage of Chordal Graphs
    Habib, Michel
    Stacho, Juraj
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 290 - +
  • [4] Domination and Cut Problems on Chordal Graphs with Bounded Leafage
    Esther Galby
    Dániel Marx
    Philipp Schepper
    Roohani Sharma
    Prafullkumar Tale
    Algorithmica, 2024, 86 : 1428 - 1474
  • [5] A SEPARATOR THEOREM FOR CHORDAL GRAPHS
    GILBERT, JR
    ROSE, DJ
    EDENBRANDT, A
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 306 - 313
  • [6] The Maximal Length of a k-Separator Permutation
    Gunby, Benjamin
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (03):
  • [7] Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
    Charis Papadopoulos
    Spyridon Tzimas
    Algorithmica, 2024, 86 : 874 - 906
  • [8] Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
    Papadopoulos, Charis
    Tzimas, Spyridon
    ALGORITHMICA, 2024, 86 (03) : 874 - 906
  • [9] Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
    Papadopoulos, Charis
    Tzimas, Spyridon
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 466 - 479
  • [10] The k-separator problem: polyhedra, complexity and approximation results
    Ben-Ameur, Walid
    Mohamed-Sidi, Mohamed-Ahmed
    Neto, Jose
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (01) : 276 - 307
12345