„bounded independence number digraph“

Suchergebnisse

3 Treffer

• Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav
• Fault Tolerant Subgraphs with Applications in Kernelization
  Lochet, William ; Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik