نتایج جستجو برای: graphoidal cover
تعداد نتایج: 109828 فیلتر نتایج به سال:
In this paper, we consider the classical NP-complete VERTEX COVER problem in large graphs. We assume that the size and the access to the input graph impose the following constraints: (1) the input graph must not be modified (integrity of the input instance), (2) the computer running the algorithm has a memory of limited size (compared to the graph) and (3) the result must be sent to an output m...
Central Research Unit The views expressed in this report are those of the researchers and do not necessarily represent those of the Department or Scottish Ministers. Further copies of this report are available priced £5.00. Cheques should be made payable to The Stationery Office Ltd and addressed to: ACKNOWLEDGEMENTS We would like to acknowledge the patience and time of the great many people, o...
[The data used in this paper were collected for the Australian Institute of Criminology’s Drug Use Monitoring in Australia project by the National Drug Research Institute at Curtin University of Technology, Marg Hauritz Pty Ltd and Forsythe Consultants Pty Ltd, with the assistance of the Queensland, New South Wales and Western Australian Police Services. Neither the collectors nor the police se...
Background/Aim: To investigate the geographic occurrence of mucosa-invading Fusobacteria in acute appendicitis. Patients and Methods: Carnoyand formalin-fixated appendices from Germany, Russia, and China were comparatively investigated. Bacteria were detected using fluorescent in situ hybridization. Cecal biopsies from patients with inflammatory bowel disease and other conditions were used as d...
Cover inequalities are a special kind of linear inequalities thatare satisfied by the feasible solutions to knapsack problems. Although ini-tially defined in the context of knapsack problems, cover inequalities andtheir variants can be used as cutting planes for a variety of integer program-ming and combinatorial optimisation problems. We review the theory ofthese inequaliti...
I am very proud and excited for the future of the Asian Oncology Nursing Society (AONS). The vision over eight years ago of developing an Asian organization has clearly become a reality. I am very grateful to have received a plaque of appreciation from AONS President, Myungsun Yi along with my colleagues Kazuko Onishi from Japan and Pongpak Pittayapan from Thailand. However, I would be remiss i...
Motivated by applications in Markov estimation and distributed computing, we deene the blanket time of an undirected graph G to be the expected time for a random walk to hit every vertex of G within a constant factor of the number of times predicted by the stationary distribution. Thus the blanket time is, essentially, the number of steps required of a random walk in order that the observed dis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید