Search results

From MaRDI portal
  • functions 2012-10-15 Paper Algorithms for finding a maximum non-\(k\)-linked graph 2012-09-12 Paper An algorithm for finding a maximum \(t\)-matching excluding...
    10 bytes (16 words) - 01:03, 7 October 2023
  • for Howard's algorithm for finding minimum mean-cost cycles 2010-12-09 Paper A deterministic subexponential algorithm for solving parity games 2010-08-16...
    10 bytes (15 words) - 08:24, 25 September 2023
  • matroid parity algorithm 2021-02-08 Paper A Blossom Algorithm for Maximum Edge-Disjoint T-Paths 2021-02-02 Paper Weighted linear matroid parity 2020-11-25...
    10 bytes (13 words) - 11:23, 28 January 2024
  • paths and cycles with parity constraints 2014-08-28 Paper Odd cycle packing 2014-08-13 Paper The Graph Minor Algorithm with Parity Conditions 2014-07-30...
    10 bytes (16 words) - 02:26, 9 December 2023
  • Paths Problem 2008-06-10 Paper An Improved Algorithm for Finding Cycles Through Elements 2008-06-10 Paper Algorithmic Graph Minor Theory: Improved Grid Minor...
    10 bytes (17 words) - 09:02, 9 December 2023
  • Upper and lower bounds for finding connected motifs in vertex-colored graphs 2011-04-28 Paper A faster algorithm for finding minimum Tucker submatrices...
    10 bytes (13 words) - 08:05, 6 October 2023
  • 2010-09-21 Paper Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs N/A Paper An FPT Algorithm for the Exact Matching Problem and...
    10 bytes (13 words) - 13:13, 6 October 2023
  • Faster Algorithm for Finding the Minimum Cut in a Directed Graph 1994-12-14 Paper https://portal.mardi4nfdi.de/entity/Q4311913 1994-10-30 Paper Finding minimum...
    10 bytes (17 words) - 13:54, 9 December 2023
  • for Comparison-Based Sorting 2023-06-30 Paper Finding dense subgraphs 2023-03-21 Paper Greedily finding a dense subgraph 2022-12-09 Paper Tight competitive...
    10 bytes (15 words) - 00:53, 9 December 2023
  • Irreducibility and deterministic \(r\)-th root finding over finite fields 2020-09-09 Paper On the polynomial parity argument complexity of the combinatorial...
    10 bytes (13 words) - 08:29, 25 September 2023
  • An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs 1986-01-01 Paper Efficient algorithms for finding minimum spanning...
    10 bytes (15 words) - 14:05, 9 December 2023
  • An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group 2014-10-14 Paper Quantum algorithms for the triangle problem...
    10 bytes (13 words) - 18:56, 11 December 2023
  • A memory-efficient and fast Huffman decoding algorithm 2016-06-16 Paper A linear time algorithm for finding depth-first spanning trees on trapezoid graphs...
    10 bytes (15 words) - 21:33, 9 December 2023
  • arcs to improve arc-connectivity 2024-03-26 Paper A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral...
    10 bytes (14 words) - 07:09, 9 December 2023
  • minimum cut algorithms 2019-09-12 Paper Quasipolynomial set-based symbolic algorithms for parity games 2019-07-04 Paper A subquadratic-time algorithm for decremental...
    10 bytes (17 words) - 02:18, 12 December 2023
  • 1992-09-17 Paper Finding a feasible course schedule using Tabu search 1992-06-28 Paper TABARIS: An exact algorithm based on tabu search for finding a maximum...
    10 bytes (14 words) - 23:53, 9 December 2023
  • path-distance-width for AT-free graphs 2011-12-16 Paper A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space 2011-12-16...
    10 bytes (13 words) - 13:37, 6 October 2023
  • 2008-06-03 Paper A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small 2007-05-02 Paper Algorithms – ESA 2004 2005-08-18...
    10 bytes (13 words) - 11:37, 28 January 2024
  • \(n^ 2\) algorithm for determining the bridges of a graph 1971-01-01 Paper An Efficient Algorithm for Graph Isomorphism 1970-01-01 Paper Algorithms for finding...
    10 bytes (17 words) - 13:02, 8 December 2023
  • de/entity/Q4414635 2003-07-25 Paper Finding a maximum induced matching in weakly chordal graphs 2003-06-09 Paper Thomason's algorithm for finding a second Hamiltonian...
    10 bytes (13 words) - 18:10, 24 September 2023