Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204): Difference between revisions

@@ aliases / en / 0 / aliases / en / 0 @@
+Simple deterministic algorithms for fully dynamic maximal matching
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6327009
@@ Property / title @@
+Simple deterministic algorithms for fully dynamic maximal matching (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05304
@@ Property / zbMATH Open document ID: 1293.05304 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2488608.2488703
@@ Property / DOI: 10.1145/2488608.2488703 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
+Normal rank
@@ Property / publication date @@
+August 2014Timestamp +2014-08-07T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2014-08-07T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 7 August 2014 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6327009
@@ Property / zbMATH DE Number: 6327009 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2133476289
@@ Property / OpenAlex ID: W2133476289 / rank @@
+Normal rank

Latest revision as of 10:20, 6 May 2024

scientific article; zbMATH DE number 6327009

Language	Label	Description	Also known as
English	Simple Deterministic Algorithms for Fully Dynamic Maximal Matching	scientific article; zbMATH DE number 6327009	Simple deterministic algorithms for fully dynamic maximal matching