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

Simple certifying algorithms for variants of the (2, 1)-colouring problem

Συγγραφείς: Contreras-Mendoza, Fernando Esteban ^a, Hernández-Cruz, César ^a

Πηγή: In Procedia Computer Science 2023 223:292-301

A certifying and dynamic algorithm for the recognition of proper circular-arc graphs

Συγγραφείς: Soulignac, Francisco J. ^{a, b, c, ⁎}

Πηγή: In Theoretical Computer Science 8 October 2021 889:105-134

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

Certifying Combinatorial Optimization: A Unified Approach Using Pseudo-Boolean Reasoning

Συγγραφείς: Oertel, Andy, Author, Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Parallel Systems, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Parallella System, Originator, Lund University, Faculty of Engineering, LTH, LTH Profile areas, LTH Profile Area: AI and Digitalization, Lunds universitet, Lunds Tekniska Högskola, LTH profilområden, LTH profilområde: AI och digitalisering, Originator, Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator, Nordström, Jakob, de Rezende, Susanna

Συνεισφορές: Oertel, Andy, Author, Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Parallel Systems, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Parallella System, Originator, Lund University, Faculty of Engineering, LTH, LTH Profile areas, LTH Profile Area: AI and Digitalization, Lunds universitet, Lunds Tekniska Högskola, LTH profilområden, LTH profilområde: AI och digitalisering, Originator, Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator, Nordström, Jakob, de Rezende, Susanna

Θεματικοί όροι: Natural Sciences, Computer and Information Sciences, Computer Sciences, Naturvetenskap, Data- och informationsvetenskap (Datateknik), Datavetenskap (Datalogi), Algorithms, Algoritmer

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://lucris.lub.lu.se/ws/files/248592548/thesis-Andy_Oertel.pdf

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm

Συγγραφείς: Francis, Mathew, Hell, Pavol, Stacho, Juraj

Πηγή: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. :1708-1727

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

A simple certifying algorithm for 3-edge-connectivity

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

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

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

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

Certifying coloring algorithms for graphs without long induced paths

Συγγραφείς: Kamiński, Marcin, Pstrucha, Anna

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

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

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

Certifying Induced Subgraphs in Large Graphs

Συγγραφείς: Meyer, Ulrich^Aff10, Tran, Hung^Aff10, Tsakalidis, Konstantinos^Aff11

Συνεισφορές: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Lin, Chun-Cheng, editor^Aff7, Lin, Bertrand M. T., editor^Aff8, Liotta, Giuseppe, editor^Aff9

Πηγή: WALCOM: Algorithms and Computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings. 13973:229-241

Certifying coloring algorithms for graphs without long induced paths

Συγγραφείς: Marcin Kaminski 0001, Anna Pstrucha

Πηγή: Discrete Applied Mathematics. 261:258-267

Θεματικοί όροι: FOS: Computer and information sciences, coloring algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Coloring of graphs and hypergraphs, obstructions, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, well-quasi-ordering, FOS: Mathematics, Mathematics - Combinatorics, \(H\)-coloring, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1703.02485
http://arxiv.org/abs/1703.02485
https://zbmath.org/7056133
https://doi.org/10.1016/j.dam.2018.09.031

Certifying Induced Subgraphs in Large Graphs: Certifying induced subgraphs in large graphs

Συγγραφείς: Ulrich Meyer 0001, Hung Tran, Konstantinos Tsakalidis

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

Θεματικοί όροι: FOS: Computer and information sciences, Perfect graphs, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, I/O-efficient certifying algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

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

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

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)

Certifying Correctness for Combinatorial Algorithms: by Using Pseudo-Boolean Reasoning

Συγγραφείς: Gocht, Stephan, Author, Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator, Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Parallel Systems, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Parallella System, Originator, Nordström, Jakob, de Rezende, Susanna

Συνεισφορές: Gocht, Stephan, Author, Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator, Lund University, Faculty of Engineering, LTH, Departments at LTH, Department of Computer Science, Parallel Systems, Lunds universitet, Lunds Tekniska Högskola, Institutioner vid LTH, Institutionen för datavetenskap, Parallella System, Originator, Nordström, Jakob, de Rezende, Susanna

Θεματικοί όροι: Natural Sciences, Computer and Information Sciences, Computer Sciences, Naturvetenskap, Data- och informationsvetenskap (Datateknik), Datavetenskap (Datalogi)

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://lucris.lub.lu.se/ws/files/117886509/thesis_final_pdf.pdf

Certifying algorithms for recognizing interval graphs and permutation graphs

Συγγραφείς: Kratsch, Dieter, McConnell, Ross M., Mehlhorn, Kurt, Spinrad, Jeremy P.

Πηγή: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. :158-167

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

Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

Συγγραφείς: Haim Kaplan, Yahav Nussbaum

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

Θεματικοί όροι: unit circular-arc, certifying algorithm, Applied Mathematics, Graph recognition, 0211 other engineering and technologies, graph recognition, 0102 computer and information sciences, 02 engineering and technology, Certifying algorithm, proper circular-arc, Unit circular-arc, 01 natural sciences, Proper circular-arc, Graph algorithms (graph-theoretic aspects), Discrete Mathematics and Combinatorics

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

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