A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Συγγραφείς: Kei Kimura, Kazuhisa Makino

Συνεισφορές: Kei Kimura and Kazuhisa Makino

Πηγή: Annals of Operations Research. 359:2483-2521

Θεματικοί όροι: FOS: Computer and information sciences, certifying algorithm, Computer Science - Data Structures and Algorithms, linear programming problem, Data Structures and Algorithms (cs.DS), Horn system

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.03368
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.47

A simple certifying algorithm for 3-edge-connectivity

Συγγραφείς: Tsin, Yung H. ¹

Πηγή: In Theoretical Computer Science 24 March 2023 951

A linear-time certifying algorithm for recognizing generalized series–parallel graphs

Συγγραφείς: Chin, Francis Y.L. ^a, Ting, Hing-Fung ^a, Tsin, Yung H. ^{b, ⁎}, Zhang, Yong ^c

Πηγή: In Discrete Applied Mathematics 30 January 2023 325:152-171

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Συγγραφείς: Kimura, Kei, Makino, Kazuhisa

Θεματικοί όροι: Computer Science - Data Structures and Algorithms

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.03368

A simple certifying algorithm for 3-edge-connectivity

Συγγραφείς: Tsin, Yung H.

Θεματικοί όροι: Computer Science - Data Structures and Algorithms

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2002.04727

A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems

Συγγραφείς: Piotr Wojciechowski 0002, K. Subramani 0001

Πηγή: Lecture Notes in Computer Science ISBN: 9783031712937

Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs: Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs''

Συγγραφείς: Jérémie Dusart, Derek G. Corneil, Michel Habib

Πηγή: SIAM Journal on Computing. 50:1148-1153

Θεματικοί όροι: bump number, posets, Hamiltonian path problem, minimum path cover problem, lexicographic depth first search, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Graph representations (geometric and intersection representations, etc.), cocomparability graphs, 0102 computer and information sciences, Paths and cycles, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://epubs.siam.org/doi/pdf/10.1137/20M1327835
https://zbmath.org/7364234
https://doi.org/10.1137/20m1327835

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Συγγραφείς: Kei Kimura and Kazuhisa Makino, Kimura, Kei, Makino, Kazuhisa

Όροι ευρετηρίου: linear programming problem, certifying algorithm, Horn system, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

Σύνδεσμος: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.47
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)

A certifying algorithm for the consecutive-ones property

Συγγραφείς: McConnell, Ross M.

Πηγή: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. :768-777

Διαθεσιμότητα: http://dl.acm.org/doi/10.5555/982792.982909

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

Συγγραφείς: Ruo-Wei Hung, Maw-Shang Chang

Πηγή: Theoretical Computer Science. 412:5351-5373

Θεματικοί όροι: Eulerian and Hamiltonian graphs, certifying algorithm, Hamiltonian cycle, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Certifying algorithms, Path cover, 0102 computer and information sciences, 02 engineering and technology, circular-arc graphs, 01 natural sciences, Theoretical Computer Science, Circular-arc graphs, Graph theory (including graph drawing) in computer science, Interval graphs, path cover, interval graphs, Computer Science(all)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/5955893
https://doi.org/10.1016/j.tcs.2011.06.009

A certifying algorithm for 3-colorability of P5-free graphs

Συγγραφείς: Bruce, Daniel, Hoang, Chinh T., Sawada, Joe

Θεματικοί όροι: Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, F.2.2

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/0907.3497

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints

Συγγραφείς: K. Subramani 0001, Piotr Wojciechowski 0002

Πηγή: Journal of Combinatorial Optimization. 35:389-408

Θεματικοί όροι: Combinatorial optimization, difference constraints, 0202 electrical engineering, electronic engineering, information engineering, UTVPI constraints, 0102 computer and information sciences, 02 engineering and technology, rounding scheme, 01 natural sciences, certificates

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/6845571
https://doi.org/10.1007/s10878-017-0176-3

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints

Συγγραφείς: K. Subramani 0001, Piotr Wojciechowski 0002

Πηγή: Algorithmica. 78:166-208

Θεματικοί όροι: theorem of the alternative, relaxation, half-integral solutions, linear feasibility, 0211 other engineering and technologies, Analysis of algorithms, UTVPI constraints, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical algorithms, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/6714288
https://doi.org/10.1007/s00453-016-0131-1

An [formula omitted]-time certifying algorithm for recognizing HHD-free graphs

Συγγραφείς: Nikolopoulos, Stavros D. ^⁎, Palios, Leonidas

Πηγή: In Theoretical Computer Science 21 September 2012 452:117-131

Computing Pivot-Minors

Συγγραφείς: Dabrowski, Konrad K.^Aff1, Dross, François^Aff2, Jeong, Jisu^Aff3, Kanté, Mamadou Moustapha^Aff4, Kwon, O-joung^{Aff5, Aff6, IDs00453026013935_cor1}, Oum, Sang-il^{Aff6, Aff7}, Paulusma, Daniël^Aff8

Πηγή: Algorithmica. 88(3)

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Συγγραφείς: Corneil, Derek G., Dalton, Barnaby, Habib, Michel

Συνεισφορές: Habib, Michel

Πηγή: SIAM Journal on Computing. 42:792-807

Θεματικοί όροι: [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 01 natural sciences

An FPT Certifying Algorithm for the Vertex-Deletion Problem

Συγγραφείς: Haiko Müller, Samuel Wilson

Συνεισφορές: Lecroq, T, Mouchard, L

Πηγή: Lecture Notes in Computer Science ISBN: 9783642452772

Σύνδεσμος πρόσβασης: https://eprints.whiterose.ac.uk/id/eprint/78364/

An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs: An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs

Συγγραφείς: Stavros D. Nikolopoulos, Leonidas Palios

Πηγή: Lecture Notes in Computer Science ISBN: 9783540738138

Θεματικοί όροι: Graph theory, HHD-free graphs, Perfectly orderable graphs, Recognition, Graph theory (including graph drawing) in computer science, 4. Education, HDD free, Certifying algorithms, perfectly orderable graphs, certifying algorithms, recognition, house-, hole- or domino-free, 7. Clean energy

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.cs.uoi.gr/~stavros/Papers/C-FAW07.pdf

A Certifying Algorithm for 3-Colorability of P 5-Free Graphs

Συγγραφείς: Daniel Bruce, Chính T. Hoàng, Joe Sawada

Πηγή: Lecture Notes in Computer Science ISBN: 9783642106309

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, F.2.2, 01 natural sciences, Computer Science - Discrete Mathematics

Σύνδεσμος πρόσβασης: http://www.cis.uoguelph.ca/~sawada/papers/P5_3Col.pdf
http://arxiv.org/abs/0907.3497

Efficient Certifying Algorithms for Linear Classification

Συγγραφείς: Bonifaci, Vincenzo^Aff10, Galatro, Sara^Aff10

Συνεισφορές: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Πηγή: Algorithms and Complexity : 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part I. 15679:153-169