Results 51 to 60 of about 915 (94)
Year in Review 1999: Cases from Alaska Supreme Court, Alaska Court of Appeals, U.S. Court of Appeals for the Ninth Circuit, and U.S. District Court for the District of Alaska [PDF]
, 2000 Asam, Michael R. +3 more
core +1 more source
Back to the Future: Applying the Collateral Bars of Section 925 of the Dodd-Frank Act to Previous Bad Acts [PDF]
, 2012 Howell, Chad
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Parallel Processing Letters, 2012The 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
Cheng, Eddie, Padmanabhan, Sachin
openaire +2 more sources
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES
Journal of Interconnection Networks, 2010The 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, RANDY JIA, DAVID LU
openaire +1 more source
Conditional matching preclusion sets
Information Sciences, 2009The 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).
Cheng, Eddie +3 more
openaire +1 more source
Conditional K-Matching Preclusion for N-Dimensionaltorus Networks
2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Xiaomin, Ren, Xiangyu, Yang, Weihua
openaire +2 more sources
Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs
International Journal of Parallel, Emergent and Distributed Systems, 2013The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion destroys all perfect matchings in the graph. The optimal matching preclusion sets are often precisely those which are induced by a single vertex of minimum degree.
Eddie Cheng +5 more
openaire +1 more source