Generating the acyclic orientations of a graph

被引：13
|
作者：
Squire, MB [1 ]
机构：
[1] IBM Corp, Dept C8KA, Res Triangle Pk, NC 27709 USA
来源：
JOURNAL OF ALGORITHMS | 1998年 / 26卷 / 02期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1006/jagm.1997.0891
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The acyclic orientations of a graph are related to its chromatic polynomial to its reliability, and to certain hyperplane arrangements. In this paper, an algorithm for listing the acyclic orientations of a graph is presented. The algorithm is shown to require O(n) time per acyclic orientation generated. This is the most efficient algorithm known for generating acyclic orientations. (C) 1998 Academic Press.
引用
收藏
页码：275 / 290
页数：16
相关论文
共 50 条
  • [31] A directed acyclic graph for interactions
    Nilsson, Anton
    Bonander, Carl
    Stromberg, Ulf
    Bjork, Jonas
    INTERNATIONAL JOURNAL OF EPIDEMIOLOGY, 2021, 50 (02) : 613 - 619
  • [32] The covering threshold of a directed acyclic graph by directed acyclic subgraphs
    Yuster, Raphael
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (04):
  • [33] On the number of Eulerian orientations of a graph
    Mihail, M.
    Winkler, P.
    Algorithmica (New York), 1996, 16 (4-5):
  • [34] ON NUMBER OF ORIENTATIONS OF A GIVEN GRAPH
    HARARY, F
    PALMER, E
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1966, 14 (03): : 125 - &
  • [35] ON THE STRUCTURE OF THE STRONG ORIENTATIONS OF A GRAPH
    DONALD, J
    ELWIN, J
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (01) : 30 - 43
  • [36] Partitions and orientations of the Rado graph
    Diestel, Reinhard
    Leader, Imre
    Scott, Alex
    Thomasse, Stephan
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2007, 359 (05) : 2395 - 2405
  • [37] Shattering, Graph Orientations, and Connectivity
    Kozma, Laszlo
    Moran, Shay
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (03):
  • [38] Efficient domination of the orientations of a graph
    Bange, DW
    Barkauskas, AE
    Host, LH
    Clark, LH
    DISCRETE MATHEMATICS, 1998, 178 (1-3) : 1 - 14
  • [39] On the number of Eulerian orientations of a graph
    Mihail, M
    Winkler, P
    ALGORITHMICA, 1996, 16 (4-5) : 402 - 414
  • [40] CYCLE LENGTHS AND GRAPH ORIENTATIONS
    PRETZEL, O
    YOUNGS, D
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (04) : 544 - 553
12345