„semicomplete digraphs“

Suchergebnisse

13 Treffer

• A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav
• Locally semicomplete digraphs
  Guo, Yubao 1995 Verl. der Augustinus-Buchh.
• Revisiting Directed Disjoint Paths on Tournaments (And Relatives)
  de C. M. Gomes, Guilherme ; Lopes, Raul ; Sau, Ignasi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Component Order Connectivity in Directed Graphs
  Bang-Jensen, Jørgen ; Eiben, Eduard ; Gutin, Gregory Z. ; Wahlström, Magnus ; Yeo, Anders 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs
  Gutin, Gregory Z. ; Yeo, Anders
• Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs
  Gutin, Gregory Z. ; Koh, Khee Meng ; Tay, Eng Guan ; Yeo, Anders
• In-tournaments and semicomplete multipartite digraphs
  Tewes, Meike 1999 Mainz
• c-Pancyclic Partial Ordering and (c–1)-Pan-Outpath Partial Ordering in Semicomplete Multipartite Digraphs
  Pan, Lin Qiang ; Zhang, Ke Min
• Transformation semigroups generated by semicomplete digraphs
  Yang, Xiuliang
• Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs
  Bang-Jensen, J. ; Haddad, M. El ; Manoussakis, Y. ; Przytycka, T. M.
• Berge’s Conjecture and Aharoni–Hartman–Hoffman’s Conjecture for Locally In-Semicomplete Digraphs
  Sambinelli, Maycon ; Negri Lintzmayer, Carla ; Nunes da Silva, Cândida ; Lee, Orlando
• A Characterization of Locally Semicomplete CKI-digraphs
  Galeana-Sánchez, Hortensia ; Olsen, Mika