Cargando…
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Fradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of tournaments. They argued that the class of digraphs of bounded independence number is structured enough to be exploited algorithmically. In this...
Autores principales: | Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10287808/ https://www.ncbi.nlm.nih.gov/pubmed/37362859 http://dx.doi.org/10.1007/s00453-022-01093-w |
Ejemplares similares
-
Parameterized Complexity of Directed Spanner Problems
por: Fomin, Fedor V., et al.
Publicado: (2021) -
Graphs and digraphs
por: Chartrand, Gary
Publicado: (1986) -
Graphs and digraphs
por: Chartrand, Gary, et al.
Publicado: (2015) -
Digraphs
por: Bang-Jensen, Jorgen, et al.
Publicado: (2009) -
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
por: Golovach, Petr A., et al.
Publicado: (2022)