Browsing by Author "86f7f5ca-cdd8-4512-855a-274d9b78911b"

Now showing items 1-3 of 3

    • Minimal Proper Interval Completions 
      Rapaport Zimermann, Iván; Suchan, Karol; Todinca, Ioan (ELSEVIER SCIENCE BV, 2008-05-31)
      Given an arbitrary graph G = (V,E) and a proper interval graph H = (V,F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich ...
    • The impact of locality on the detection of cycles in the broadcast congested clique model 
      Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan (Springer Verlag, 2018)
      The broadcast congested clique model is a message-passing model of distributed computation where n nodes communicate with each other in synchronous rounds. The joint input to the n nodes is an undirected graph G on the ...
    • Three notes on distributed property testing 
      Even, Guy; Fischer, Orr; Fraigniaud, Pierre; Gonen, Tzlil; Levi, Reut; Medina, Moti; Montealegre, Pedro; Olivetti, Dennis; Oshman, Rotem; Rapaport Zimermann, Iván; Todinca, Ioan (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      In this paper we present distributed property-testing algorithms for graph properties in thecongestmodel, with emphasis on testing subgraph-freeness. Testing a graph propertyPmeansdistinguishing graphsG= (V,E)having ...