scholarly journals A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games

2012 ◽  
Author(s):  
René van den Brink ◽  
Gerard van der Laan ◽  
Nigel Moes
Keyword(s):  
Free Graph ◽  
Graph Games ◽  
Strategic Implementation

scholarly journals A strategic implementation of the Average Tree solution for cycle-free graph games

2013 ◽  
Vol 148 (6) ◽  
pp. 2737-2748 ◽  
Author(s):  
René van den Brink ◽  
Gerard van der Laan ◽  
Nigel Moes
Keyword(s):  
Free Graph ◽  
Graph Games ◽  
Strategic Implementation

scholarly journals The average tree solution for cycle-free graph games

2008 ◽  
Vol 62 (1) ◽  
pp. 77-92 ◽  
Author(s):  
P. Jean Jacques Herings ◽  
Gerard van der Laan ◽  
Dolf Talman
Keyword(s):  
Free Graph ◽  
Graph Games

scholarly journals The Component Fairness Solution for Cycle-free Graph Games

2006 ◽  
Author(s):  
P. Jean-Jacques Herings ◽  
Gerard van der Laan ◽  
Dolf J. J. Talman
Keyword(s):  
Free Graph ◽  
Graph Games

scholarly journals Parameterized fairness axioms on cycle-free graph games

2011 ◽  
Vol 52 (3) ◽  
pp. 487-497
Author(s):  
S. Ryuo ◽  
K. Sato ◽  
Y. Yamamoto
Keyword(s):  
Free Graph ◽  
Graph Games

Implementation of the Australasian Teletrial Model: Translating idea into action using implementation science frameworks

2021 ◽  
pp. 1357633X2110178
Author(s):  
Sabe Sabesan ◽  
Marie Malica ◽  
Chantal Gebbie ◽  
Clare Scott ◽  
David Thomas ◽  
...  
Keyword(s):  
Implementation Science ◽  
Pilot Project ◽  
Final Report ◽  
Rare Cancer ◽  
Government Investment ◽  
Implementation Framework ◽  
Advisory Groups ◽  
Regulatory Systems ◽  
Key Stakeholders ◽  
Strategic Implementation

Background: Despite Government investment, disparity in access to clinical trials continue between metropolitan and regional & rural sectors (RRR) in Australia and around the world. To improve trial access closer to home for RRR communities and rare cancer patients even in metro settings, the Australasian Teletrial Model (ATM) was developed by Clinical Oncology Society of Australia and implemented in four states. Aim of this paper is to describe the steps and processes involved in the development and implementation of ATM guided by implementation science frameworks. Method: Two implementation science frameworks namely iPARIHS and Strategic Implementation Framework were chosen to guide the project. Details of steps and processes were extracted from COSA final report. Results: ATM met the criteria for worthy innovation. For the development and implementation of the ATM, stakeholders were at national, statewide and clinical levels. A co-design with end-users and inclusion of key stakeholders in steering committees and advisory groups made the implementation smoother. Clinician levers including advocacy were useful to overcome system barriers. During the project, more patients, and clinicians at RRR participated in trials, more primary sites collaborated with RRR sites and more RRR sites gained trial capabilities. Conclusion: Pilot project achieved its objectives including improved access to patients locally, creation of linkages between metro and RRR sites and enhanced capabilities of and access to RRR sites. Implementation science frameworks were useful for identifying the necessary steps and processes at the outset. Ownership by governments and creation of streamlined regulatory systems would enable broader adoption.

scholarly journals Toughness, Forbidden Subgraphs and Pancyclicity

2021 ◽  
Vol 37 (3) ◽  
pp. 839-866
Author(s):  
Wei Zheng ◽  
Hajo Broersma ◽  
Ligong Wang
Keyword(s):  
Recent Article ◽  
Forbidden Subgraph ◽  
Forbidden Subgraphs ◽  
Free Graph ◽  
Induced Subgraph ◽  
Complete Answer ◽  
Open Case

AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$ K 1 ∪ P 4 can act as a forbidden subgraph to ensure that every 1-tough H-free graph is hamiltonian, and that there is no other forbidden subgraph with this property, except possibly for the graph $$K_1\cup P_4$$ K 1 ∪ P 4 itself. The hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs, as conjectured by Nikoghosyan, was left there as an open case. In this paper, we consider the stronger property of pancyclicity under the same condition. We find that the results are completely analogous to the hamiltonian case: every graph H such that any 1-tough H-free graph is hamiltonian also ensures that every 1-tough H-free graph is pancyclic, except for a few specific classes of graphs. Moreover, there is no other forbidden subgraph having this property. With respect to the open case for hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs we give infinite families of graphs that are not pancyclic.

scholarly journals Bidding mechanisms in graph games

2021 ◽  
Vol 119 ◽  
pp. 133-144
Author(s):  
Guy Avni ◽  
Thomas A. Henzinger ◽  
Đorđe Žikelić
Keyword(s):  
Graph Games

scholarly journals Universal and unavoidable graphs

2021 ◽  
pp. 1-14
Author(s):  
Matija Bucić ◽  
Nemanja Draganić ◽  
Benny Sudakov
Keyword(s):  
Free Graph ◽  
Turán Number ◽  
Work Done

Abstract The Turán number ex(n, H) of a graph H is the maximal number of edges in an H-free graph on n vertices. In 1983, Chung and Erdős asked which graphs H with e edges minimise ex(n, H). They resolved this question asymptotically for most of the range of e and asked to complete the picture. In this paper, we answer their question by resolving all remaining cases. Our result translates directly to the setting of universality, a well-studied notion of finding graphs which contain every graph belonging to a certain family. In this setting, we extend previous work done by Babai, Chung, Erdős, Graham and Spencer, and by Alon and Asodi.

A Strategic Approach for implementing A Smart Pedestrian Network (SPN) System

2021 ◽  
Vol 11 (1) ◽  
pp. 208-217
Author(s):  
George Papageorgiou ◽  
Anastasia Ioannou ◽  
Athanasios Maimaris ◽  
Alexander Ness
Keyword(s):  
System Structure ◽  
Sustainable Mobility ◽  
Implementation Framework ◽  
Customer Involvement ◽  
Multiple Stakeholder ◽  
Strategic Approach ◽  
Pedestrian Network ◽  
Strategic Implementation ◽  
Agile Software ◽  
Urban Conditions

Abstract This paper presents a strategic approach for implementing a Smart Pedestrian Network (SPN) navigation System that is geared towards promoting sustainable mobility. The SPN system is being designed to reach multiple market segments by providing information on suitable walking routes aiming to satisfy potential users’ needs, but also multiple stakeholder demands. The paper presents the main objectives of the SPN system as well as its system structure, application features, functions, and relevant data sources. The proposed strategic implementation framework deems necessary for scaling up so that the SPN system is successfully implemented in a variety of urban conditions. The framework emphasizes the element of adaptability, so that SPN can be adjusted where and when necessary, to deal with a variety of contexts and specific sustainable mobility issues, depending on the particular municipality conditions. The proposed framework combines elements of both the waterfall and agile software development methods, as well as, aspects of Open Innovation, Customer Involvement and Co-Creation taking a multiple stakeholder approach.

Sign in / Sign up

Export Citation Format

Share Document