Results 241 to 250 of about 608,403 (284)
Component connectivity of hypercubes
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weihua Yang, Shurong Zhang
exaly +3 more sources
The g-component connectivity of graphs
Theoretical Computer Science, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuming Zhou
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Component connectivity of the hypercubes
International Journal of Computer Mathematics, 2012The r-component connectivity κ r (G) of the non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q n for r=2, 3, …, n+1, and we classify all the corresponding optimal solutions.
Eddie Cheng, Laszlo Liptak
exaly +2 more sources
Component Connectivity of Augmented Cubes
SSRN Electronic Journal, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qifan Zhang +2 more
openaire +2 more sources
2022
Abstract Let us return to the configuration model of uncorrelated networks with a given degree distribution P(q) and exploit its local tree-likeness to explore basic structural features of these networks. The elements of the techniques that we use here were first implemented in graph theory (Pittel 1990; Molloy and Reed, 1995, 1998), and
Sergey N. Dorogovtsev +1 more
openaire +1 more source
Abstract Let us return to the configuration model of uncorrelated networks with a given degree distribution P(q) and exploit its local tree-likeness to explore basic structural features of these networks. The elements of the techniques that we use here were first implemented in graph theory (Pittel 1990; Molloy and Reed, 1995, 1998), and
Sergey N. Dorogovtsev +1 more
openaire +1 more source
Component Edge Connectivity of Hypercubes
International Journal of Foundations of Computer Science, 2018Fault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection network. The component edge connectivity is a generalization of the traditional edge connectivity.
Shuli Zhao +3 more
openaire +1 more source
On the Performance of Connected Components Grouping
International Journal of Computer Vision, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Berengolts, Michael Lindenbaum
openaire +1 more source
Optimization of Component Connections for an Embedded Component System
2009 International Conference on Computational Science and Engineering, 2009Software component techniques are widely used to enhance productivity and reduce the cost of software systems development. This paper proposes optimization of component connections for a component system that is suitable for embedded systems. This component system adopts a static model that statically instantiates and connects components.
Takuya Azumi +2 more
openaire +1 more source
Connected-component stereo aggregation
2010 IEEE Asia Pacific Conference on Circuits and Systems, 2010Stereo vision algorithms can be divided into several general stages. Detailed analysis on each specific stage allows focused improvement of the entire algorithm. Existing stereo vision algorithms typically prioritize pixel and sub-pixel accuracy, focusing on the optimization stage, while commercial algorithms which prioritize real-time operation ...
Oon-Ee Ng +2 more
openaire +1 more source