On the number of connected components of the ramification locus of a morphism of Berkovich curves
Sign Up to like & getrecommendations! Published in 2017 at "Mathematische Annalen"
DOI: 10.1007/s00208-018-1668-x
Abstract: Let k be a complete nontrivially valued non-archimedean field. Given a finite morphism of quasi-smooth k-analytic curves that admit finite triangulations, we provide upper bounds for the number of connected components of the ramification locus in… read more here.
Keywords: connected components; components ramification; morphism; ramification locus ... See more keywords
On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3859-0
Abstract: A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only… read more here.
Keywords: graph cyclically; connected components; decomposition connected; connected graph ... See more keywords
Improving printing orientation for Fused Deposition Modeling printers by analyzing connected components
Sign Up to like & getrecommendations! Published in 2018 at "Additive manufacturing"
DOI: 10.1016/j.addma.2018.06.007
Abstract: Abstract The spatial orientation of an object on a 3D printing plate is a significant contributor to its printing time. Thus, the speed of the 3D printing processes can generally be increased by using time-efficient… read more here.
Keywords: connected components; orientation; improving printing; fused deposition ... See more keywords
S-shaped connected components of positive solutions for Minkowski-curvature Neumann problems with indefinite weight
Sign Up to like & getrecommendations! Published in 2025 at "Journal of Mathematical Physics"
DOI: 10.1063/5.0239395
Abstract: We are concerned with the existence of S-shaped connected components of positive solutions for the Minkowski-curvature Neumann problem. The proof of the main results is based upon the bifurcation technique. read more here.
Keywords: minkowski curvature; positive solutions; shaped connected; components positive ... See more keywords
Infinite WARM graphs III: strong reinforcement regime
Sign Up to like & getrecommendations! Published in 2023 at "Nonlinearity"
DOI: 10.1088/1361-6544/acc9a0
Abstract: We study a reinforcement process on graphs G of bounded degree. The model involves a parameter α > 0 governing the strength of reinforcement, and Poisson clock rates λ v at the vertices v of the graph.… read more here.
Keywords: reinforcement regime; reinforcement; strong reinforcement; connected components ... See more keywords
A MapReduce-Based Approach for Fast Connected Components Detection from Large-Scale Networks
Sign Up to like & getrecommendations! Published in 2024 at "Big Data"
DOI: 10.1089/big.2022.0264
Abstract: Owing to increasing size of the real-world networks, their processing using classical techniques has become infeasible. The amount of storage and central processing unit time required for processing large networks is far beyond the capabilities… read more here.
Keywords: based approach; mapreduce based; scale networks; large scale ... See more keywords
Multithreaded two-pass connected components labelling and particle analysis in ImageJ
Sign Up to like & getrecommendations! Published in 2021 at "Royal Society Open Science"
DOI: 10.1098/rsos.201784
Abstract: Sequential region labelling, also known as connected components labelling, is a standard image segmentation problem that joins contiguous foreground pixels into blobs. Despite its long development history and widespread use across diverse domains such as… read more here.
Keywords: connected components; multithreaded two; region labelling; components labelling ... See more keywords
Structural Controllability for a Class of Complex Networks With Root Strongly Connected Components
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.2971616
Abstract: Structural controllability of complex networks has been an attractive research area, and Minimum Inputs Theorem was proposed to identify the minimum driver nodes for complex networks with one-dimensional node dynamics. Then, the Minimum Inputs Theorem… read more here.
Keywords: structural controllability; connected components; root strongly; complex networks ... See more keywords
Consistency-Induced Multiview Subspace Clustering
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Cybernetics"
DOI: 10.1109/tcyb.2022.3165550
Abstract: Multiview clustering has received great attention and numerous subspace clustering algorithms for multiview data have been presented. However, most of these algorithms do not effectively handle high-dimensional data and fail to exploit consistency for the… read more here.
Keywords: consistency; number connected; connected components; subspace clustering ... See more keywords
Corrigendum: Connected components of affine Deligne–Lusztig varieties in mixed characteristic
Sign Up to like & getrecommendations! Published in 2017 at "Compositio Mathematica"
DOI: 10.1112/s0010437x1600782x
Abstract: We correct an error in our paper ‘Connected components of affine Deligne–Lusztig varieties in mixed characteristic’. read more here.
Keywords: connected components; varieties mixed; deligne lusztig; affine deligne ... See more keywords
UniCon: A unified star-operation to efficiently find connected components on a cluster of commodity hardware
Sign Up to like & getrecommendations! Published in 2022 at "PLOS ONE"
DOI: 10.1371/journal.pone.0277527
Abstract: With a cluster of commodity hardware, how can we efficiently find all connected components of an enormous graph containing hundreds of billions of nodes and edges? The problem of finding connected components has been used… read more here.
Keywords: find connected; operation; star; efficiently find ... See more keywords