Výsledky vyhledávání - "Output-polynomial algorithm"

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

Autoři: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a další

Přispěvatelé: Troy A. Shahoumian Hewlett Packard Laboratories At U. C. Berkeley a další

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

Témata: Theory of Computation, Randomized Algorithms, Straight-Line

Popis souboru: application/postscript

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

Dostupnost: 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

Compactly Generating All Satisfying Truth Assignments of a Horn Formula

Autoři: Wild, Marcel

Zdroj: Journal on Satisfiability, Boolean Modeling and Computation. 8:63-82

Témata: FOS: Computer and information sciences, Horn formula, Computer Science - Logic in Computer Science, Mathematics - Logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Logic in Computer Science (cs.LO), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Output-polynomial algorithm, Logic (math.LO), Mathematics, Algorithms, Fixed-cardinality models

Popis souboru: application/pdf

Přístupová URL adresa: https://content.iospress.com:443/download/journal-on-satisfiability-boolean-modeling-and-computation/sat190088?id=journal-on-satisfiability-boolean-modeling-and-computation%2Fsat190088
http://arxiv.org/abs/1012.1769
https://arxiv.org/abs/1012.1769
http://ui.adsabs.harvard.edu/abs/2010arXiv1012.1769W/abstract
http://scholar.sun.ac.za/bitstream/handle/10019.1/16105/wild_compactly_2012.pdf;sequence=3
http://dblp.uni-trier.de/db/journals/corr/corr1012.html#abs-1012-1769
https://scholar.sun.ac.za:443/handle/10019.1/16105
https://dblp.uni-trier.de/db/journals/corr/corr1012.html#abs-1012-1769

An Incremental Algorithm for Computing n-Dimensional Concepts

Autoři: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a další

Přispěvatelé: Bazin, Alexandre Kahn, Giacomo Raynaud, Olivier a další

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

Témata: 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

Dostupnost: 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

Enumerating all geodesics

Autoři: Wild, Marcel

Témata: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/2409.16955

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

Autoři: Könen, David Stiglmayr, Michael

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 376, p1-14. 14p.

Témata: *MULTI-objective optimization, *ALGORITHMS, *COMPUTATIONAL complexity, *OPTIMIZATION algorithms

Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.

Autoři: Klimm, Max Warode, Philipp

Zdroj: SIAM Journal on Computing; 2025, Vol. 54 Issue 5, p1241-1293, 53p

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

Autoři: Kanté, Mamadou Moustapha Limouzy, Vincent Mary, Arnaud a další

Témata: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, 68P05, 68R10, 05C69, 05C85, 05C30, E.1, F.0, G.2.2, text

URL: http://arxiv.org/abs/1407.2036

POLYNOMIAL TIME ALGORITHMS FOR COMPUTING A MINIMUM HULL SET IN DISTANCE-HEREDITARY AND CHORDAL GRAPHS.

Autoři: KANTÉ, MAMADOU MOUSTAPHA NOURINE, LHOUARI

Zdroj: SIAM Journal on Discrete Mathematics; 2016, Vol. 30 Issue 1, p311-326, 16p

Témata: POLYNOMIAL time algorithms, CONVEXITY spaces, GEODESICS, GRAPH connectivity, UNDIRECTED graphs, SUBGRAPHS, SET theory

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets

Autoři: Bonamy, Marthe Defrain, Oscar Micek, Piotr a další

Témata: Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2004.07214

Maximal cliques in scale-free random graphs.

Zdroj: Network Science; Dec2024, Vol. 12 Issue 4, p1-26, 26p

Témata: POLYNOMIALS, CONTRADICTION

Computing all Wardrop Equilibria parametrized by the Flow Demand

Autoři: Klimm, Max Warode, Philipp

Témata: Computer Science - Computer Science and Game Theory, text

URL: http://arxiv.org/abs/1805.12383

Carbon Pricing in Traffic Networks

Autoři: Griesbach, Svenja M. Harks, Tobias Klimm, Max a další

Témata: Computer Science and Game Theory, FOS: Computer and information sciences, Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, 91A07, 91A68, 90C25, Computer Science and Game Theory (cs.GT)

Přístupová URL adresa: http://arxiv.org/abs/2508.09280

An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems.

Autoři: Bökler, Fritz Parragh, Sophie N. Sinnl, Markus a další

Zdroj: Mathematical Methods of Operations Research; Aug2024, Vol. 100 Issue 1, p263-290, 28p

Témata: LINEAR programming, POLYNOMIAL time algorithms, ALGORITHMS, PROBLEM solving, POLYNOMIALS

Complexity of the multiobjective minimum weight minimum stretch spanner problem.

Autoři: Bökler, Fritz Jasper, Henning

Zdroj: Mathematical Methods of Operations Research; Aug2024, Vol. 100 Issue 1, p65-83, 19p

Témata: TRANSPORTATION planning, EMERGENCY management, TELECOMMUNICATION systems, WRENCHES, COMMUNICATION planning

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.

Autoři: Kanté, Mamadou Moustapha Limouzy, Vincent Mary, Arnaud a další

Zdroj: Graph-Theoretic Concepts in Computer Science: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers; 2016, p138-153, 16p

Enumerating minimal dominating sets in chordal bipartite graphs.

Autoři: Golovach, Petr A. Heggernes, Pinar Kanté, Mamadou M. a další

Zdroj: Discrete Applied Mathematics. Jan2016, Vol. 199, p30-36. 7p.

Témata: *BIPARTITE graphs, *SET theory, *ENUMERATIVE geometry, *POLYNOMIALS, *TRANSVERSAL lines, *HYPERGRAPHS

PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION.

Autoři: CONTE, ALESSIO GROSSI, ROBERTO MARINO, ANDREA a další

Zdroj: SIAM Journal on Computing; 2022, Vol. 51 Issue 5, p1580-1625, 46p

Témata: BIPARTITE graphs, PARENT-child relationships, DIRECTED graphs, SUBGRAPHS, POLYNOMIALS

Enumeration of Support-Closed Subsets in Confluent Systems.

Autoři: Haraguchi, Kazuya Nagamochi, Hiroshi

Zdroj: Algorithmica; May2022, Vol. 84 Issue 5, p1279-1315, 37p

Témata: DIRECTED graphs, GRAPH connectivity, UNDIRECTED graphs, SUBGRAPHS

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

Autoři: Golovach, Petr A. Heggernes, Pinar Kanté, Mamadou Moustapha a další

Zdroj: Algorithmica; Feb2018, Vol. 80 Issue 2, p714-741, 28p

Témata: POLYNOMIAL chaos, MATHEMATICAL decomposition, SET theory, SET functions, REAL variables

Efficient Reasoning for Inconsistent Horn Formulae.

Autoři: Marques-Silva, Joao Ignatiev, Alexey Mencía, Carlos a další

Zdroj: Logics in Artificial Intelligence: 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings; 2016, p336-352, 17p