Výsledky vyhľadávania - Output-polynomial algorithms

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems

Autori: David Könen Michael Stiglmayr

Zdroj: Discrete Applied Mathematics. 376:1-14

Predmety: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/abs/2305.12867

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: Eppstein, David David Eppstein

Prispievatelia: Eppstein, David David Eppstein

Zdroj: Algorithmica, vol 86, iss 9

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Non-crossing Hamiltonian path, Applied Mathematics, non-crossing structures, 0102 computer and information sciences, Pure Mathematics, Output-sensitive enumeration, 01 natural sciences, Mathematical Sciences, Computation Theory & Mathematics, Approximate counting, Computer Science - Data Structures and Algorithms, Information and computing sciences, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), polygonalization, ddc:004, output-sensitive algorithms, 0101 mathematics, Polygonalization

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2303.00147
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29
https://escholarship.org/uc/item/8g54s4qn
https://escholarship.org/uc/item/3zw640xf

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees

Autori: Hiroki Arimura Takeaki Uno

Zdroj: Lecture Notes in Computer Science ISBN: 9783540281771

Prístupová URL adresa: https://link.springer.com/chapter/10.1007/11536314_1
https://rd.springer.com/chapter/10.1007/11536314_1
https://core.ac.uk/display/20746466
https://dblp.uni-trier.de/db/conf/ilp/ilp2005.html#ArimuraU05

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: Eppstein, David David Eppstein

Prispievatelia: Eppstein, David David Eppstein

Predmety: polygonalization, non-crossing structures, output-sensitive algorithms

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Dostupnosť: https://doi.org/10.4230/LIPIcs.SoCG.2023.29
https://nbn-resolving.org/urn:nbn:de:0030-drops-178790
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29

Proximity Search for Maximal Subgraph Enumeration

Autori: Conte, Alessio Grossi, Roberto Marino, Andrea a ďalší

Prispievatelia: Conte, Alessio Grossi, Roberto Marino, Andrea a ďalší

Zdroj: SIAM Journal on Computing. 51:1580-1625

Predmety: graph enumeration, output polynomial, polynomial delay, proximity search, FOS: Computer and information sciences, 0102 computer and information sciences, [INFO] Computer Science [cs], 05C30, 05C85, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), graph enumeration polynomial delay proximity search, F.2.2

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1912.13446
https://inria.hal.science/hal-03913673v1/document
https://doi.org/10.1137/20m1375048
https://inria.hal.science/hal-03913673v1

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

Autori: Golovach, Petr A. Heggernes, Pinar Kanté, Mamadou Moustapha a ďalší

Prispievatelia: Golovach, Petr A. Heggernes, Pinar Kanté, Mamadou Moustapha a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783662489703

Predmety: FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Data Structures and Algorithms, 1. No poverty, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), 16. Peace & justice

Prístupová URL adresa: http://arxiv.org/pdf/1509.03753
http://arxiv.org/abs/1509.03753
https://dblp.uni-trier.de/db/conf/isaac/isaac2015.html#GolovachHKKSV15
https://arxiv.org/pdf/1509.03753v2
https://rd.springer.com/chapter/10.1007/978-3-662-48971-0_22
https://link.springer.com/10.1007/978-3-662-48971-0_22
https://link.springer.com/chapter/10.1007/978-3-662-48971-0_22/fulltext.html
https://link.springer.com/article/10.1007/s00453-017-0289-1
https://hal.archives-ouvertes.fr/hal-02083480
https://link.springer.com/article/10.1007/s00453-017-0289-1/figures/1
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#GolovachHKKSV18
https://doi.org/10.1007/s00453-017-0289-1
https://rd.springer.com/article/10.1007/s00453-017-0289-1

Parameterized Algorithms for Computing Pareto Sets

Autori: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a ďalší

Prispievatelia: Könen, Joshua Marc Röglin, Heiko Stuck, Tarek a ďalší

Predmety: parameterized algorithms, treewidth, multicriteria optimization problems, multicriteria MST, multicriteria TSP, polygon aggregation

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.105

Dostupnosť: https://doi.org/10.4230/LIPIcs.ESA.2025.105
https://nbn-resolving.org/urn:nbn:de:0030-drops-245749
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.105

Implicit Computation: an Output-Polynomial Algorithm for Evaluating Straight-Line Programs

Autori: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a ďalší

Prispievatelia: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a ďalší

Zdroj: http://fog.hpl.external.hp.com/techreports/1999/HPL-1999-25.ps.

Predmety: Theory of Computation, Randomized Algorithms, Straight-Line

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.9351

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.9351
http://fog.hpl.external.hp.com/techreports/1999/HPL-1999-25.ps

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: David Eppstein Eppstein, David

Témy: polygonalization, non-crossing structures, output-sensitive algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.29
Is Part Of LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)

Polynomial inversion hardware accelerator for post quantum algorithm.

Autori: Divya, B Raja Sekar, K David Selvakumar, A a ďalší

Zdroj: Sādhanā: Academy Proceedings in Engineering Sciences; Dec2025, Vol. 50 Issue 4, p1-14, 14p

Predmety: CRYPTOGRAPHY, POLYNOMIALS, ALGORITHMS, PROGRAMMABLE logic devices, COMPUTATIONAL complexity, OPTIMIZATION algorithms

An Incremental Algorithm for Computing n-Dimensional Concepts

Autori: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a ďalší

Prispievatelia: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a ďalší

Zdroj: https://hal.archives-ouvertes.fr/hal-01653717 ; 2017.

Predmety: Polyadic Concept Analysis, Incremental Algorithm, Output-polynomial Algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Relation: hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717; https://hal.archives-ouvertes.fr/hal-01653717/document; https://hal.archives-ouvertes.fr/hal-01653717/file/NCremental.pdf

Dostupnosť: https://hal.archives-ouvertes.fr/hal-01653717
https://hal.archives-ouvertes.fr/hal-01653717/document
https://hal.archives-ouvertes.fr/hal-01653717/file/NCremental.pdf

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time

Autori: Eppstein, D

Témy: Information and computing sciences, publication

URL: https://escholarship.org/uc/item/8g54s4qn

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA.

Autori: Waris, Ayesha Aziz, Arshad Khan, Bilal Muhammad

Zdroj: PLoS ONE; 11/11/2025, Vol. 20 Issue 11, p1-29, 29p

Predmety: CRYPTOGRAPHY, PUBLIC key cryptography, FIELD programmable gate arrays, RESOURCE allocation, DATA pipelining, ALGORITHMS

Enumerating Minimal Dominating Sets in Triangle-Free Graphs

Autori: Bonamy, Marthe Defrain, Oscar Heinrich, Marc a ďalší

Prispievatelia: Bonamy, Marthe Defrain, Oscar Heinrich, Marc a ďalší

Zdroj: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
https://hal.science/hal-02181721
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩

Predmety: triangle-free graphs, split graphs, minimal dominating set, output-polynomial algorithms, enumeration algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Geografické téma: Berlin, Germany

Dostupnosť: https://hal.science/hal-02181721
https://hal.science/hal-02181721v1/document
https://hal.science/hal-02181721v1/file/LIPIcs-STACS-2019-16.pdf
https://doi.org/10.4230/LIPIcs.STACS.2019.16

Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices

Autori: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Prispievatelia: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Predmety: Totally unimodular matrices, Vertices of polyhedra, Vertex enumeration, Hypergraph transversals, Hypergraph decomposition, Output polynomial-time algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18

Dostupnosť: https://doi.org/10.4230/LIPIcs.SWAT.2018.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-88441
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18

The Complexity of Maximal Common Subsequence Enumeration

Autori: Giovanni Buzzega Alessio Conte Yasuaki Kobayashi a ďalší

Zdroj: Proceedings of the ACM on Management of Data. 3:1-19

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Prístupová URL adresa: http://arxiv.org/abs/2504.04757

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs

Autori: Kurita, Kazuhiro Mann, Kevin

Predmety: FOS: Computer and information sciences, Computational Complexity, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Prístupová URL adresa: http://arxiv.org/abs/2507.07528

Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation.

Autori: Hutchison, David Kanade, Takeo Kittler, Josef a ďalší

Zdroj: Graph-Theoretic Concepts in Computer Science (978-3-540-74838-0); 2007, p316-327, 12p

New Results on Monotone Dualization and Generating Hypergraph Transversals: New results on monotone dualization and generating hypergraph transversals

Autori: Eiter, T Gottlob, G Makino, K

Zdroj: SIAM Journal on Computing. 32:514-537

Predmety: FOS: Computer and information sciences, combinatorial enumeration, Analysis of algorithms and problem complexity, Applications of graph theory, 0211 other engineering and technologies, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, dualization, Computational Complexity (cs.CC), Hypergraphs, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), Boolean functions, hypergraph acyclicity, Database theory, output-polynomial algorithms, F.2.2, F.1.3, transversal computation, Computer Science - Computational Complexity, hypergraphs, Knowledge representation, Graph theory (including graph drawing) in computer science, Switching theory, application of Boolean algebra, limited nondeterminism

Popis súboru: application/xml

Prístupová URL adresa: http://arxiv.org/abs/cs/0204009
https://arxiv.org/pdf/cs/0204009
https://ui.adsabs.harvard.edu/abs/2002cs........4009E/abstract
http://portal.acm.org/citation.cfm?doid=509907.509912
http://www.kr.tuwien.ac.at/staff/eiter/et-archive/dual-stoc02.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0204.html#cs-DS-0204009
https://www.cs.ox.ac.uk/publications/publication176-abstract.html
https://ora.ox.ac.uk/objects/uuid:08358504-8295-4044-add3-3e389c6cfa59
https://ora.ox.ac.uk/objects/uuid:0f8cffd0-f051-4deb-91a7-84054df48cc2
https://ora.ox.ac.uk/objects/uuid:6ad59704-11d2-497d-8fd1-3906bb0b7519
https://doi.org/10.1145/509907.509912

An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.

Autori: Kramer, Stefan Pfahringer, Bernhard Arimura, Hiroki a ďalší

Zdroj: Inductive Logic Programming (9783540281771). 2005, p1-19. 19p.