×

Found 665 Documents (Results 1–100)

Recognizing DAGs with page-number 2 is NP-complete. (English) Zbl 07727773

Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 361-370 (2023).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI

Exact learning of multitrees and almost-trees using path queries. (English) Zbl 07719351

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 293-311 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs. (English) Zbl 1506.90166

Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 1. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1015, 867-878 (2022).
MSC:  90C11 90C35 91D30
PDFBibTeX XMLCite
Full Text: DOI

Feasibility analysis of conditional DAG tasks. (English) Zbl 07699461

Brandenburg, Björn B. (ed.), 33rd Euromicro conference on real-time systems, ECRTS 2021, virtual conference, July 5–9, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 196, Article 12, 17 p. (2021).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of a linear ordering of weighted directed acyclic graphs. (English. Russian original) Zbl 1472.05065

Mosc. Univ. Math. Bull. 76, No. 1, 35-36 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 1, 55-57 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Fixed-parameter algorithms for longest heapable subsequence and maximum binary tree. (English) Zbl 07764098

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 7, 16 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Asymptotics of minimal deterministic finite automata recognizing a finite binary language. (English) Zbl 07651050

Drmota, Michael (ed.) et al., 31st international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2020, Klagenfurt, Austria (virtual conference), June 15–19, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 159, Article 11, 13 p. (2020).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI

Leafy spanning arborescences in DAGs. (English) Zbl 07600764

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 50-62 (2020).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On algebraic expressions of two-terminal directed acyclic graphs. (English) Zbl 1456.05077

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 248-259 (2020).
MSC:  05C25
PDFBibTeX XMLCite
Full Text: DOI

On the structure of acyclic binary relations. (English) Zbl 07625092

Medina, Jesús (ed.) et al., Information processing and management of uncertainty in knowledge-based systems. Applications. 17th international conference, IPMU 2018, Cádiz, Spain, June 11–15, 2018, Proceedings, Part III. Cham: Springer. Commun. Comput. Inf. Sci. 855, 3-15 (2018).
PDFBibTeX XMLCite
Full Text: DOI

On the number of variables in special classes of random lambda-terms. (English) Zbl 1486.03031

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 25, 14 p. (2018).
MSC:  03B40 05C20 05C90
PDFBibTeX XMLCite
Full Text: DOI

Persistent homology over directed acyclic graphs. (English) Zbl 1419.55009

Chambers, Erin Wolf (ed.) et al., Research in computational topology. Based on the first workshop for women in computational topology, Minneapolis, MN, USA, August 2016. Cham: Springer; Minneapolis, MN: Institute for Mathematics and its Applications (IMA). Assoc. Women Math. Ser. 13, 11-32 (2018).
MSC:  55N35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software