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

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)

Verification Witnesses

Συγγραφείς: Beyer, Dirk, Dangl, Matthias, Dietsch, Daniel, Heizmann, Matthias, Lemberger, Thomas, Tautschnig, Michael

Πηγή: ACM Transactions on Software Engineering and Methodology (TOSEM). 31(4):1-69

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

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

Maya-Tupi graphs: a generalization of split graphs

Συγγραφείς: Araújo, Júlio ^a, Hernández-Cruz, César ^b, Sales, Claudia Linhares ^c

Πηγή: In Procedia Computer Science 2025 273:485-492

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

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

Συνεισφορές: Goos, Gerhard, Series 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, Bowles, Juliana, editor^Aff7, Søndergaard, Harald, editor^Aff8

Πηγή: Logic-Based Program Synthesis and Transformation : 34th International Symposium, LOPSTR 2024, Milan, Italy, September 9–10, 2024, Proceedings. 14919:99-114

On the Finiteness of k-Vertex-Critical -Free Graphs with Forbidden Induced Squids or Bulls

Συγγραφείς: Adekanye, Melvin^Aff11, Bury, Christopher^Aff11, Cameron, Ben^Aff12, Knodel, Thaler^Aff11

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

Πηγή: Combinatorial Algorithms : 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings. 14764:301-313

Vertex-critical [formula omitted]-free and vertex-critical (gem, co-gem)-free graphs

Συγγραφείς: Abuadas, Tala ^a, Cameron, Ben ^{b, ⁎}, Hoàng, Chính T. ^a, Sawada, Joe ^c

Πηγή: In Discrete Applied Mathematics 15 February 2024 344:179-187

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs: Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs

Συγγραφείς: Boris Klemz, Günter Rote

Πηγή: Algorithmica. 84:1064-1080

Θεματικοί όροι: ddc:004, FOS: Computer and information sciences, certifying algorithm, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, 01 natural sciences, induced matching, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), graph algorithm, Computer Science - Data Structures and Algorithms, Analysis of algorithms, chain cover, Data Structures and Algorithms (cs.DS), 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung, Informatik, dynamic programming, convex bipartite graph, Induced matching, Graph algorithm, Certifying algorithm, Chain cover, Graph theory (including graph drawing) in computer science, Convex bipartite graph, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: https://link.springer.com/content/pdf/10.1007/s00453-021-00904-w.pdf
http://arxiv.org/abs/1711.04496
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/26787
https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-267876
https://opus.bibliothek.uni-wuerzburg.de/files/26787/Klemz-Rote_Algorithmica.pdf
https://doi.org/10.1007/s00453-021-00904-w

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

Συγγραφείς: Soulignac, Francisco Juan

Πηγή: CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas

Θεματικοί όροι: dynamic representation, FOS: Computer and information sciences, certifying algorithm, proper Helly circular-arc graphs, Discrete Mathematics (cs.DM), Graph representations (geometric and intersection representations, etc.), 68R10, 0102 computer and information sciences, CERTIFYING ALGORITHM, 01 natural sciences, PROPER HELLY CIRCULAR-ARC GRAPHS, proper circular-arc graphs, proper interval graph, PROPER CIRCULAR-ARC GRAPHS, PROPER INTERVAL GRAPH, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), DYNAMIC REPRESENTATION, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: https://arxiv.org/pdf/1509.05828.pdf
http://arxiv.org/abs/1509.05828
http://hdl.handle.net/11336/173301

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

Συγγραφείς: Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin, Yong Zhang 0001

Πηγή: Discrete Applied Mathematics. 325:152-171

Θεματικοί όροι: certifying algorithm, series-parallel graph, generalized series-parallel graph, ear-decomposition, depth-first search, 0102 computer and information sciences, 01 natural sciences, recognition algorithm, outerplanar graph, certificate authentication, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, graph algorithm, forbidden structure, Parallel algorithms in computer science, certificate, 0101 mathematics

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

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

A simple certifying algorithm for 3-edge-connectivity

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

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

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

Vertex-critical $(P_3+\ell P_1)$-free and vertex-critical (gem, co-gem)-free graphs: Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs

Συγγραφείς: Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada

Πηγή: Discret. Appl. Math.. 344:179-187

Θεματικοί όροι: FOS: Computer and information sciences, certifying algorithm, Discrete Mathematics (cs.DM), critical graph, Analysis of algorithms and problem complexity, co-gem-free graph, 0102 computer and information sciences, 01 natural sciences, Coloring of graphs and hypergraphs, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), graph coloring, FOS: Mathematics, Mathematics - Combinatorics, gem-free graph, Combinatorics (math.CO), vertex-critical graph, Computer Science - Discrete Mathematics

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

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

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path: Better 3-coloring algorithms: excluding a triangle and a seven vertex path

Συγγραφείς: Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong

Πηγή: THEORETICAL COMPUTER SCIENCE

Θεματικοί όροι: FOS: Computer and information sciences, Technology, certifying algorithm, Technology and Engineering, General Computer Science, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 46 Information and computing sciences, 01 natural sciences, Theoretical Computer Science, Computation Theory & Mathematics, GRAPH ALGORITHM, Coloring of graphs and hypergraphs, Computer Science, Theory & Methods, Forbidden induced subgraphs, Graph algorithms (graph-theoretic aspects), graph algorithm, graph coloring, forbidden induced subgraphs, FOS: Mathematics, Mathematics - Combinatorics, GRAPH COLORING, 01 Mathematical Sciences, Science & Technology, Graph algorithm, Certifying algorithm, CERTIFYING ALGORITHM, FORBIDDEN INDUCED SUBGRAPHS, Graph coloring, Mathematics and Statistics, Computer Science, 08 Information and Computing Sciences, Combinatorics (math.CO), 49 Mathematical sciences, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: https://www.sciencedirect.com/science/article/am/pii/S0304397520306150
http://arxiv.org/abs/1410.0040
http://hdl.handle.net/11336/173276
https://biblio.ugent.be/publication/8746432
https://biblio.ugent.be/publication/8746432/file/01GRTMD4M037Z0A3XMJ0BTEM15
http://hdl.handle.net/1854/LU-8746432
http://doi.org/10.1016/j.tcs.2020.10.032

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

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs: Computing vertex-disjoint paths in large graphs using MAOs

Συγγραφείς: Johanna E. Preißer, Jens M. Schmidt

Συνεισφορές: Johanna E. Preißer and Jens M. Schmidt

Πηγή: Algorithmica. 82:146-162

Θεματικοί όροι: Big Data, Connectivity, maximal adjacency ordering, Computing Disjoint Paths, maximum cardinality search, Maximum Cardinality Search, 0102 computer and information sciences, certifying algorithms, large graphs, 7. Clean energy, 01 natural sciences, vertex-connectivity, Vertex-Connectivity, Linear-Time, big data, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Maximal Adjacency Ordering, computing disjoint paths, linear-time algorithms, Certifying Algorithm, Analysis of algorithms, Large Graphs, Paths and cycles

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

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2018/9961/pdf/LIPIcs-ISAAC-2018-13.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.13

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

Συγγραφείς: Klemz, Boris, Rote, Günter

Θεματικοί όροι: Graph algorithm, Induced matching, Chain cover, Convex bipartite graph, Certifying algorithm, Dynamic programming, ddc:004

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

Διαθεσιμότητα: https://refubium.fu-berlin.de/handle/fub188/33847
https://doi.org/10.17169/refubium-33566
https://doi.org/10.1007/s00453-021-00904-w

Correcting matrix products over the ring of integers

Συγγραφείς: Yu-Lun Wu, Hung-Lung Wang

Πηγή: Information Processing Letters. 186:106496

Θεματικοί όροι: FOS: Computer and information sciences, certifying algorithm, design of algorithms, Discrete Mathematics (cs.DM), matrix multiplication, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Symbolic computation and algebraic computation, algorithms, Computer Science - Discrete Mathematics

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

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