Independent Set Reconfiguration on Directed Graphs

被引:0
|
作者
Ito, Takehiro [1 ]
Iwamasa, Yuni [2 ]
Kobayashi, Yasuaki [3 ]
Nakahata, Yu [4 ]
Otachi, Yota [5 ]
Takahashi, Masahiro [2 ]
Wasa, Kunihiro [6 ]
机构
[1] Graduate School of Information Sciences, Tohoku University, Sendai, Japan
[2] Graduate School of Informatics, Kyoto University, Kyoto, Japan
[3] Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan
[4] Division of Information Science, Nara Institute of Science and Technology, Ikoma, Japan
[5] Graduate School of Informatics, Nagoya University, Nagoya, Japan
[6] Faculty of Science and Engineering, Hosei University, Tokyo, Japan
关键词
Number: JP19K11814,JP22K17851,JP22H00513,JP20H00595,JP22H03549,JP20K23323,JP20H05795,JP19H01103,JP20H05794,JP18H04091,JP20K19742,JP22K17854,JP22K17849,JP20H05793,JP19K20350,21K11752, Acronym: [!text type='JS']JS[!/text]PS, Sponsor: Japan Society for the Promotion of Science,;
D O I
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022
中图分类号
学科分类号
摘要
Directed graphs
引用
收藏
相关论文
共 50 条
  • [41] Subset feedback vertex set on graphs of bounded independent set size
    Papadopoulos, Charis
    Tzimas, Spyridon
    THEORETICAL COMPUTER SCIENCE, 2020, 814 : 177 - 188
  • [42] Counting maximal independent sets in directed path graphs
    Lin, Min-Sheng
    Su, Sheng-Huang
    INFORMATION PROCESSING LETTERS, 2014, 114 (10) : 568 - 572
  • [43] Resilient Multipath Routing With Independent Directed Acyclic Graphs
    Cho, Sangman
    Elhourani, Theodore
    Ramasubramanian, Srinivasan
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [44] Independent Directed Acyclic Graphs for Resilient Multipath Routing
    Cho, Sangman
    Elhourani, Theodore
    Ramasubramanian, Srinivasan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (01) : 153 - 162
  • [45] Regression of directed graphs on independent effects for density and reciprocity
    Zijlstra, Bonne J. H.
    JOURNAL OF MATHEMATICAL SOCIOLOGY, 2017, 41 (04): : 185 - 192
  • [46] On independent set in B1-EPG graphs
    Bessy, Stephane
    Bougeret, Marin
    Chaplick, Steven
    Goncalves, Daniel
    Paul, Christophe
    DISCRETE APPLIED MATHEMATICS, 2020, 278 : 62 - 72
  • [47] On approximability of the independent set problem for low degree graphs
    Chlebík, M
    Chlebíková, J
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 47 - 56
  • [48] On the maximum independent set problem in subclasses of subcubic graphs
    Lozin, Vadim
    Monnot, Jerome
    Ries, Bernard
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 31 : 104 - 112
  • [49] Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
    Bose, Prosenjit
    Carmi, Paz
    Keil, Mark J.
    Maheshwari, Anil
    Mehrabi, Saeed
    Mondal, Debajyoti
    Smid, Michiel
    ALGORITHMS AND DATA STRUCTURES, WADS 2019, 2019, 11646 : 211 - 224
  • [50] On the maximum independent set problem in subclasses of planar graphs
    Lozin V.
    Milanič M.
    Journal of Graph Algorithms and Applications, 2010, 14 (02) : 269 - 286