Results 131 to 140 of about 210 (161)

Decentralization, Europeanization, State Restructuring, and the Politics of Instruments Accumulation: The Case of the French Housing Sector

Regulation &Governance, EarlyView.
ABSTRACT This paper advances research on policy accumulation by analyzing its political consequences in the French housing sector. It argues that, in the context of decentralization reforms, the accumulation of policy instruments has undermined national steering capacities and intensified territorial inequalities.
Francesco Findeisen, Patrick Le Galès
wiley   +1 more source

How Can Law Be Robust in the Face of Heightened Societal Turbulence?

Regulation &Governance, EarlyView.
ABSTRACT Taking its cue from the growing frequency of disruptive crises, new research argues that crisis‐induced turbulence calls for robust governance based on adaptation and innovation. While law plays a key role in the effort of governments to govern robustly, the robustness of law has received scant regard.
Eva Sørensen, Jacob Torfing, Peter Triantafillou   +2 more
wiley   +1 more source

Conditional matching preclusion for regular bipartite graphs and their Cartesian product

Discrete Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruizhi Lin
exaly   +4 more sources

Conditional matching preclusion sets

Information Sciences, 2009
The matching preclusion concept was introduced as a measure of robustness in interconnection networks. A desired property is that the only minimum way to preclude a perfect (respectively, almost-perfect) matching is to delete all edges incident to a single vertex (respectively, all edges incident to two vertices).
Eddie Cheng, Linda Leśniak, László Lipták   +2 more
exaly   +3 more sources

Conditional Matching Preclusion Sets for an Mixed-Graph of the Star Graph and the Bubble-Sort Graph

Lecture Notes in Computer Science, 2015
The conditional matching preclusion number of a graph is the minimum number of edges, whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. Any such optimal set is called an optimally conditional matching preclusion set.
Shiying Wang, Wang Shiying
exaly   +3 more sources

Conditional Matching Preclusion for Folded Hypercubes

Journal of Interconnection Networks, 2019
Let G be a graph with an even number of vertices. The matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion results in a graph with no isolated vertices and without a perfect ...
Ruizhi Lin, Heping Zhang
openaire   +2 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Parallel Processing Letters, 2012
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to
Eddie Cheng 0001, Sachin Padmanabhan
openaire   +3 more sources

Conditional matching preclusion of enhanced hypercubes

Discrete Applied Mathematics
Weihua Yang
exaly   +3 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

Journal of Interconnection Networks, 2010
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex.
Eddie Cheng 0001, Randy Jia, David Lu
openaire   +2 more sources