Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • o(log4 n) time parallel maximal matching algorithm using linear number of processors 2004-11-11 Paper A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST...
    10 bytes (18 words) - 16:21, 12 December 2023
  • o(log4 n) time parallel maximal matching algorithm using linear number of processors 2004-11-11 Paper A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST...
    10 bytes (18 words) - 16:21, 12 December 2023
  • of Publication Type Self-stabilization and Byzantine tolerance for maximal matching 2023-08-02 Paper Self-stabilizing Distributed Stable Marriage 2022-11-04...
    10 bytes (16 words) - 01:49, 9 December 2023
  • 2011-10-10 Paper A new self-stabilizing maximal matching algorithm 2009-03-30 Paper A New Self-stabilizing Maximal Matching Algorithm 2007-11-15 Paper Distributed...
    10 bytes (16 words) - 12:04, 6 October 2023
  • Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks 2016-03-03 Paper An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous...
    10 bytes (16 words) - 17:44, 24 September 2023
  • Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks 2016-03-03 Paper An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous...
    10 bytes (16 words) - 02:19, 25 September 2023
  • maximum matching problem 2011-10-10 Paper A new self-stabilizing maximal matching algorithm 2009-03-30 Paper A New Self-stabilizing Maximal Matching Algorithm...
    10 bytes (16 words) - 12:04, 6 October 2023
  • Publication Date of Publication Type The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs 2019-06-06 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 11:13, 7 October 2023
  • self-stabilizing 1-maximal matching algorithm for general graphs 2019-06-06 Paper A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks...
    10 bytes (16 words) - 23:58, 24 September 2023
  • 2015-01-13 Paper Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings 2014-01-10 Paper...
    10 bytes (16 words) - 18:13, 11 December 2023
  • 2016-09-21 Paper Fully Dynamic Maximal Matching in $O(\log n)$ Update Time 2015-06-02 Paper Fully Dynamic Maximal Matching in O (log n) Update Time 2014-07-30...
    10 bytes (17 words) - 14:14, 7 October 2023
  • 2021-07-28 Paper Tight approximation ratio for Minimum Maximal Matching 2020-02-06 Paper Optimal general matchings 2018-11-22 Paper A 4/5 -- approximation algorithm...
    10 bytes (16 words) - 22:17, 24 September 2023
  • Publication Date of Publication Type Tight inapproximability of minimum maximal matching on bipartite graphs and related problems 2022-10-19 Paper https://portal...
    10 bytes (16 words) - 19:19, 24 September 2023
  • 2023-04-11 Paper A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching 2022-02-22 Paper Near-Optimal Approximate Shortest Paths and Transshipment...
    10 bytes (16 words) - 17:21, 6 October 2023
  • Brief Announcement 2019-09-19 Paper A self-stabilizing algorithm for maximal matching in link-register model 2019-01-30 Paper Space-optimal counting in population...
    10 bytes (16 words) - 12:35, 7 October 2023
  • polynomial self-stabilizing 1-maximal matching algorithm for general graphs 2019-06-06 Paper A new decomposition technique for maximal clique enumeration for...
    10 bytes (16 words) - 11:43, 7 October 2023
  • Publication Date of Publication Type A DNA algorithm for the maximal matching problem 2016-04-15 Paper...
    10 bytes (18 words) - 12:10, 6 October 2023
  • distributed complexity of the semi-matching problem 2016-08-04 Paper A faster distributed algorithm for computing maximal matchings deterministically 2015-09-11...
    10 bytes (17 words) - 14:52, 28 January 2024
  • for the rank-maximal matching problem 2018-10-04 Paper Characterisation of Strongly Stable Matchings 2018-07-16 Paper Rank-Maximal Matchings – Structure...
    10 bytes (16 words) - 19:05, 24 September 2023
  • Algorithms for Matching and Vertex Cover on Massive Graphs 2019-10-15 Paper A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching 2019-10-15...
    10 bytes (16 words) - 09:44, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)