Results 51 to 60 of about 477,458 (300)

Stable and Dynamic Minimum Cuts

Journal of Graph Algorithms and Applications
We consider the two problems of maintaining an exact minimum cut, and of maintaining a $\rho$-approximate cut, in dynamic graphs under the vertex-arrival model. We investigate the trade-off between the stability of a solution---the minimum number of vertex flips required to transform an induced bipartition into another when a new vertex arrives---and ...
Andrés López Martínez, Mark de Berg, Frits C. R. Spieksma   +2 more
openaire   +1 more source

A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms

, 1996
Given a connected undirected multigraph with n vertices and m edges, we first propose a new unifying heuristic approach to approximately solving the minimum cut and the s-t minimum cut problems by using efficient algorithms for the corresponding minimum ...
Ohtsuka, Keiji, Iwano, Kazuo, Katoh, Naoki, Yoshimura, Nobuhiko, Dai, Yang, Imai, Hiroshi   +5 more
core   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen, Calogero Virgone, Antje Redlich, Michael Abele, Ricardo Lopez‐Almaraz, Tal Ben‐Ami, Ewa Bien, Gianni Bisogno, Maja Mazic Cesen, Andrea Ferrari, Malgorzata A. Krawczyk, Yves Reguerre, Dominik T. Schneider, Ines B. Brecht, Charlotte Rigaud, Bilgehan Yalcin, Rainer Claus, Christian Vokuhl, Constantin Lapa, Jörg Fuchs, Segolene Hescot, Thomas Walter, Julien Hadoux, Daniel Orbach   +23 more
wiley   +1 more source

Sufficient Conditions for Maximally Edge-Connected and Super-Edge-Connected Graphs Depending on The Clique Number

Discussiones Mathematicae Graph Theory, 2019
Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj   +1 more source

Minimum replication min-cut partitioning

, 1996
[[abstract]]Logic replication has been shown to be very effective in reducing the number of cut nets in partitioned circuits. Liu et al. in considered the circuit partitioning problem with logic replication for separating two given nodes and presented an
Mak,Wai-Kei, Wong,D. F.
core   +1 more source

Health‐Related Quality of Life and Symptom Severity Among Patients With PIK3CA‐Related Overgrowth Spectrum: A Mixed‐Methods Study to Understand Real‐World Experience With Alpelisib Treatment

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu, Kaitlin LaGasse, Cory D. Saucier, Kimberly Raymond, Miranda Lauher‐Charest, Lauren Crowder, Beilei Cai, Mary Lisha Paul, Denise Adams   +8 more
wiley   +1 more source

Reliability and cost optimisation of complex electric power networks using ant colony algorithm

ITM Web of Conferences, 2017
The article presents a new approach towards reducing an overall cost of electric power network with maintaining its reliability. Goals are achieved by implementing an ant colony algorithm with a cut-set method as a method for reliability evaluation.
Piątek Łukasz
doaj   +1 more source

Fault tree analysis of large-scale blackout accidents [PDF]

E3S Web of Conferences, 2019
Fault tree analysis method is used to analyze the large-scale blackout accidents. Minimum cut sets and minimum path sets of large-scale blackout accidents are calculated, and the structural importance degree of the accidents is analyzed according to the ...
Fu Dong, Gao Song, Yan Zhenhong, Wu Hongye, Xu Xiaohu, Xu Kaili   +5 more
doaj   +1 more source

Clinical and Biological Features of Response in Resistant Neuroblastoma to 131I‐Metaiodobenzylguanidine Radiotherapy in the Anti‐GD2 Immunotherapy Era

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background 131I‐metaiodobenzylguanidine (131I‐MIBG) radiotherapy is a key treatment for relapsed and refractory (R/R) neuroblastoma (NB). Patients with R/R disease treated in the modern era are increasingly exposed to anti‐GD2 immunotherapy, which exerts selective pressure and may modify both tumor cell state and microenvironment.
Benjamin J. Lerman, Katherine K. Matthay, Fabienne Hollinger, Catriona Black, Ann A. Lazar, Miguel Pampaloni, Steven G. DuBois, Kieuhoa T. Vo   +7 more
wiley   +1 more source

A Recursive Solution to the Global Maximum Minimum Cut Problem with a Fixed Sink

Algorithms
In graph theory and network design, the minimum cut is a fundamental measure of system connectivity and communication capacity. While prior research has largely focused on computing the minimum cut for a fixed source–sink pair, practical scenarios such ...
Xiaoyao Huang, Shuo Quan, Jie Wu
doaj   +1 more source