Matches in SemOpenAlex for { <https://semopenalex.org/work/W3216633476> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W3216633476 endingPage "409" @default.
- W3216633476 startingPage "395" @default.
- W3216633476 abstract "We present compact distributed interactive proofs for the recognition of two important graph classes, well-studied in the context of centralized algorithms, namely complement reducible graphs and distance-hereditary graphs. Complement reducible graphs (also called cographs) are defined as the graphs not containing a four-node path $P_4$ as an induced subgraph. Distance-hereditary graphs are a super-class of cographs, defined as the graphs where the distance (shortest paths) between any pair of vertices is the same on every induced connected subgraph. First, we show that there exists a distributed interactive proof for the recognition of cographs with two rounds of interaction. More precisely, we give a $mathsf{dAM}$ protocol with a proof size of $mathcal{O}(log n)$ bits that uses shared randomness and recognizes cographs with high probability. Moreover, our protocol can be adapted to verify any Turing-decidable predicate restricted to cographs in $mathsf{dAM}$ with certificates of size $mathcal{O}(log n)$. Second, we give a three-round, $mathsf{dMAM}$ interactive protocol for the recognition of distance-hereditary graphs, still with a proof size of $mathcal{O}(log n)$ bits and also using shared randomness. Finally, we show that any one-round (denoted $mathsf{dM}$) or two-round, $mathsf{dMA}$ protocol for the recognition of cographs or distance-hereditary graphs requires certificates of size $Omega(log n)$ bits. Moreover, we show that any constant-round $mathsf{dAM}$ protocol using shared randomness requires certificates of size $Omega(log log n)$." @default.
- W3216633476 created "2021-12-06" @default.
- W3216633476 creator A5025299913 @default.
- W3216633476 creator A5028025649 @default.
- W3216633476 creator A5045992675 @default.
- W3216633476 date "2020-01-01" @default.
- W3216633476 modified "2023-09-26" @default.
- W3216633476 title "Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs." @default.
- W3216633476 cites W144954708 @default.
- W3216633476 cites W1561580896 @default.
- W3216633476 cites W1579049696 @default.
- W3216633476 cites W1970517175 @default.
- W3216633476 cites W1981303423 @default.
- W3216633476 cites W1981356557 @default.
- W3216633476 cites W1989983876 @default.
- W3216633476 cites W1999120866 @default.
- W3216633476 cites W2000275001 @default.
- W3216633476 cites W2011183291 @default.
- W3216633476 cites W2017345786 @default.
- W3216633476 cites W2028775537 @default.
- W3216633476 cites W2040405987 @default.
- W3216633476 cites W2043573147 @default.
- W3216633476 cites W2053093839 @default.
- W3216633476 cites W2053991811 @default.
- W3216633476 cites W2055745794 @default.
- W3216633476 cites W2056295140 @default.
- W3216633476 cites W2066354186 @default.
- W3216633476 cites W2067665576 @default.
- W3216633476 cites W2100440346 @default.
- W3216633476 cites W2136749024 @default.
- W3216633476 cites W2143327390 @default.
- W3216633476 cites W2184633425 @default.
- W3216633476 cites W2295809089 @default.
- W3216633476 cites W2493557058 @default.
- W3216633476 cites W2583517397 @default.
- W3216633476 cites W2748096547 @default.
- W3216633476 cites W2811088724 @default.
- W3216633476 cites W2885131583 @default.
- W3216633476 cites W2889545431 @default.
- W3216633476 cites W2960251115 @default.
- W3216633476 cites W2962736685 @default.
- W3216633476 cites W2968391807 @default.
- W3216633476 cites W3021194740 @default.
- W3216633476 cites W3022323839 @default.
- W3216633476 cites W3044843373 @default.
- W3216633476 cites W3046669889 @default.
- W3216633476 cites W3157038403 @default.
- W3216633476 cites W3115551859 @default.
- W3216633476 hasPublicationYear "2020" @default.
- W3216633476 type Work @default.
- W3216633476 sameAs 3216633476 @default.
- W3216633476 citedByCount "0" @default.
- W3216633476 crossrefType "journal-article" @default.
- W3216633476 hasAuthorship W3216633476A5025299913 @default.
- W3216633476 hasAuthorship W3216633476A5028025649 @default.
- W3216633476 hasAuthorship W3216633476A5045992675 @default.
- W3216633476 hasConcept C105795698 @default.
- W3216633476 hasConcept C108710211 @default.
- W3216633476 hasConcept C114614502 @default.
- W3216633476 hasConcept C118615104 @default.
- W3216633476 hasConcept C125112378 @default.
- W3216633476 hasConcept C2524010 @default.
- W3216633476 hasConcept C33923547 @default.
- W3216633476 hasConcept C63553672 @default.
- W3216633476 hasConceptScore W3216633476C105795698 @default.
- W3216633476 hasConceptScore W3216633476C108710211 @default.
- W3216633476 hasConceptScore W3216633476C114614502 @default.
- W3216633476 hasConceptScore W3216633476C118615104 @default.
- W3216633476 hasConceptScore W3216633476C125112378 @default.
- W3216633476 hasConceptScore W3216633476C2524010 @default.
- W3216633476 hasConceptScore W3216633476C33923547 @default.
- W3216633476 hasConceptScore W3216633476C63553672 @default.
- W3216633476 hasLocation W32166334761 @default.
- W3216633476 hasOpenAccess W3216633476 @default.
- W3216633476 hasPrimaryLocation W32166334761 @default.
- W3216633476 isParatext "false" @default.
- W3216633476 isRetracted "false" @default.
- W3216633476 magId "3216633476" @default.
- W3216633476 workType "article" @default.