In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs. It was proposed… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Xiaona Li, Junli Zhao, Yumei Ma, Pingping Wang, Hongyi Sun, Yi Tang
- Soft Comput.
- 2017

Partition technology is the key step to realize the extensional architecture in the cloud and support the data placement on… (More)

Is this relevant?

2017

2017

1. Wagner S, Conrad F, Bakaraju RC, Fedtke C, Ehrmann K, Holden BA. Power profiles of single vision and multifocal soft contact… (More)

Is this relevant?

Review

2016

Review

2016

Evolutionary developmental biology (evo-devo) represents a paradigm shift in the understanding of the ontogenesis and… (More)

Is this relevant?

2012

2012

- Yi-Shun Wang, Hsin-Hui Lin, Yi-Wen Liao
- BJET
- 2012

With the proliferation of weblogs (blogs) used in educational contexts, gaining a better understanding of why students are… (More)

Is this relevant?

Review

2011

Review

2011

If Bayesian Fundamentalism existed, Jones & Love’s (J&L’s) arguments would provide a necessary corrective. But it does not… (More)

Is this relevant?

2010

2010

- Margarita Bianco
- 2010

This study investigated the effect of the disability labels learning disabilities (LD) and emotional and behavioral disorders… (More)

Is this relevant?

2008

2008

- Angela Shapiro
- 2008

Statistical inference for equality constrained problems in multivariate analysis is well established and widely known. An account… (More)

Is this relevant?

2005

2005

- Laura J. Wagner
- 2005

Two studies looked at whether children used transitivity as a structural cue to telicity semantics. Telicity comprehension was… (More)

Is this relevant?

2002

2002

Responding to a stimulus that predicts an outcome can be weakened if other stimuli are presented in compound with this stimulus… (More)

Is this relevant?

1999

1999

- Srinivasa Rao Arikati, Kurt Mehlhorn
- Inf. Process. Lett.
- 1999

The Stoer–Wagner algorithm computes a minimum cut in a weighted undirected graph. The algorithm works in n−1 phases, where n is… (More)

Is this relevant?