Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285107913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chaining algorithms for multiple genome comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: The harmonious coloring problem is NP-complete for interval and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate proof-labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and their coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Distributed Certification of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact distributed certification of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distributed Merlin-Arthur decision protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized proof-labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3179347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed algorithms for coloring interval graphs with application to multicoloring trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Linear-Time Recognition of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Distributed Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Chain Subgraph Cover and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6065460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Distributed Verifiers in Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distance multiplication of unit-Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trade-offs in distributed interactive proofs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:36, 4 December 2024

scientific article
Language Label Description Also known as
English
Distributed interactive proofs for the recognition of some geometric intersection graph classes
scientific article

    Statements

    Distributed interactive proofs for the recognition of some geometric intersection graph classes (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2022
    0 references
    distributed decision
    0 references
    proof-labeling scheme
    0 references
    distributed interactive proofs
    0 references
    intersection graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references