scholarly journals Distributed Large Independent Sets in One Round on Bounded-Independence Graphs

Author(s):  
Magnús M. Halldórsson ◽  
Christian Konrad
2020 ◽  
Vol 30 (1) ◽  
pp. 53-67 ◽  
Author(s):  
Dmitriy S. Taletskii ◽  
Dmitriy S. Malyshev

AbstractFor any n, in the set of n-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.


2020 ◽  
Vol 16 (3) ◽  
pp. 1-31
Author(s):  
Daniel Lokshtanov ◽  
Fahad Panolan ◽  
Saket Saurabh ◽  
Roohani Sharma ◽  
Meirav Zehavi

2021 ◽  
Vol 344 (7) ◽  
pp. 112376
Author(s):  
John Engbers ◽  
Lauren Keough ◽  
Taylor Short

Cosmic ray measurements on mountains are limited in general to altitudes below about 4000 meters. Above this height Regener has made successful use of small balloons carrying self-recording apparatus, and occasional flights have been made with manned balloons by Piccard, Cosyns, and by American workers. Balloon experiments are, however, hardly practicable in this country, so we decided to investigate cosmic rays, and in particular the production of showers, using an aeroplane. Facilities for flying to a height of about 10 km. Were generously provided by the Air Ministry. Apparatus Two independent sets of three tube counters were used in conjunction with the usual coincidence counting circuits. The counters could be arranged in a vertical line to record vertical penetrating particles, or in a triangle to record showers. The triple coincidences were recorded by telephone counters which were photographed at intervals together with a clock and aneroid barometer. The detailed design of the apparatus required some consideration since the aeroplane available (the Vickers Vespa machine used for high altitude experiments at the Royal Aircraft Establishment) had an open observer’s cockpit in which the counting set had to be installed.


2009 ◽  
Vol 109 (4) ◽  
pp. 248-253 ◽  
Author(s):  
Hongbo Hua ◽  
Yaoping Hou

1993 ◽  
Vol 7 (3) ◽  
pp. 409-412 ◽  
Author(s):  
David Madigan

Directed acyclic independence graphs (DAIGs) play an important role in recent developments in probabilistic expert systems and influence diagrams (Chyu [1]). The purpose of this note is to show that DAIGs can usefully be grouped into equivalence classes where the members of a single class share identical Markov properties. These equivalence classes can be identified via a simple graphical criterion. This result is particularly relevant to model selection procedures for DAIGs (see, e.g., Cooper and Herskovits [2] and Madigan and Raftery [4]) because it reduces the problem of searching among possible orientations of a given graph to that of searching among the equivalence classes.


2016 ◽  
Vol 55 (7-8) ◽  
pp. 847-856 ◽  
Author(s):  
Martin Doležal ◽  
Wiesław Kubiś
Keyword(s):  

2011 ◽  
Vol 159 (4) ◽  
pp. 165-173 ◽  
Author(s):  
Raquel S.F. Bravo ◽  
Sulamita Klein ◽  
Loana Tito Nogueira ◽  
Fábio Protti

Sign in / Sign up

Export Citation Format

Share Document