Zobrazeno 1 - 10
of 3 233
pro vyhledávání: '"Enumeration algorithms"'
Combinatorial problems such as combinatorial optimization and constraint satisfaction problems arise in decision-making across various fields of science and technology. In real-world applications, when multiple optimal or constraint-satisfying soluti
Externí odkaz:
http://arxiv.org/abs/2412.00284
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Nurmi, Tarmo, Kivelä, Mikko
To understand the structure of a network, it can be useful to break it down into its constituent pieces. This is the approach taken in a multitude of successful network analysis methods, such as motif analysis. These methods require one to enumerate
Externí odkaz:
http://arxiv.org/abs/2308.00083
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the numbers of
Externí odkaz:
http://arxiv.org/abs/2212.07119
Enumerating simple cycles has important applications in computational biology, network science, and financial crime analysis. In this work, we focus on parallelising the state-of-the-art simple cycle enumeration algorithms by Johnson and Read-Tarjan
Externí odkaz:
http://arxiv.org/abs/2202.09685
We introduce annotated grammars, an extension of context-free grammars which allows annotations on terminals. Our model extends the standard notion of regular spanners, and is more expressive than the extraction grammars recently introduced by Peterf
Externí odkaz:
http://arxiv.org/abs/2201.00549
Autor:
Capelli, Florent, Strozecki, Yann
The quality of enumeration algorithms is often measured by their delay, that is, the maximal time spent between the output of two distinct solutions. If the goal is to enumerate $t$ distinct solutions for any given $t$, then another relevant measure
Externí odkaz:
http://arxiv.org/abs/2108.10208
Autor:
Haraguchi, Kazuya, Nagamochi, Hiroshi
Publikováno v:
In Theoretical Computer Science 26 June 2023 963
We investigate the enumeration of query results for an important subset of CQs with projections, namely star and path queries. The task is to design data structures and algorithms that allow for efficient enumeration with delay guarantees after a pre
Externí odkaz:
http://arxiv.org/abs/2101.03712