Log in

Relevant bibliographies by topics / Minimum Cuts

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Minimum Cuts'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Minimum Cuts.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Minimum Cuts"

1

Bonsma, Paul. "Most balanced minimum cuts." Discrete Applied Mathematics 158, no. 4 (2010): 261–76. http://dx.doi.org/10.1016/j.dam.2009.09.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Armon, Amitai, and Uri Zwick. "Multicriteria Global Minimum Cuts." Algorithmica 46, no. 1 (2006): 15–26. http://dx.doi.org/10.1007/s00453-006-0068-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Erdős, Péter L., András Frank, and László Székely. "Minimum multiway cuts in trees." Discrete Applied Mathematics 87, no. 1-3 (1998): 67–75. http://dx.doi.org/10.1016/s0166-218x(98)00049-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Jianzhong, and Mao Cheng Cai. "Inverse problem of minimum cuts." Mathematical Methods of Operations Research 47, no. 1 (1998): 51–58. http://dx.doi.org/10.1007/bf01193836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sharifov, F. A. "Minimum cuts in parametric networks." Cybernetics and Systems Analysis 30, no. 6 (1994): 885–90. http://dx.doi.org/10.1007/bf02366447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Borisavljevic, Mirjana. "Minimum segments in sequent derivations." Publications de l'Institut Math?matique (Belgrade) 74, no. 88 (2003): 5–18. http://dx.doi.org/10.2298/pim0374005b.

Full text

Abstract:

In a system of sequents for intuitionistic predicate logic derivations without a special kind of cuts (maximum cuts) will be considered. The following be shown: in a derivation without maximum cuts there are paths of the same form as paths in a normal derivation of natural deduction, i.e., these paths have the E-part, the I-part, and one minimum part which corresponds to a minimum segment in a normal derivation.

APA, Harvard, Vancouver, ISO, and other styles

7

Karger, David R., and Rajeev Motwani. "An $\NC$ Algorithm for Minimum Cuts." SIAM Journal on Computing 26, no. 1 (1997): 255–72. http://dx.doi.org/10.1137/s0097539794273083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shigeno, Maiko. "Minimax inverse problems of minimum cuts." Networks 39, no. 1 (2001): 7–14. http://dx.doi.org/10.1002/net.10000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Karger, David R. "Minimum cuts in near-linear time." Journal of the ACM 47, no. 1 (2000): 46–76. http://dx.doi.org/10.1145/331605.331608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lee, D. T., M. Sarrafzadeh, and Y. F. Wu. "Minimum Cuts for Circular-Arc Graphs." SIAM Journal on Computing 19, no. 6 (1990): 1041–50. http://dx.doi.org/10.1137/0219071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Minimum Cuts"

1

López, Martínez Andrés. "Parallel Minimum Cuts : An improved CREW PRAM algorithm." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287962.

Full text

Abstract:

This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. It has near-linear work O(m log2 n + n log6 n) and low depth O(log3 n), and returns the correct result with high probability. This is the first improvement to the best previous O(m log4 n) work and O(log3 n) depth CREW PRAM min-cut algorithm by Geissmann and Gianinazzi [SPAA’18]. For his randomized near-linear min-cut al

APA, Harvard, Vancouver, ISO, and other styles

2

Balcioglu, Ahmet. "An algorithm for enumerating the near-minimum weight s-t cuts of a graph Ahmet Balcioglu." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA387157.

Full text

Abstract:

Thesis (M.S. in Operations Research) Naval Postgraduate School, December 2000.<br>Thesis advisors, R. Kevin Wood, Craig W. Rasmussen. Includes bibliographical references (p. 41-43). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

3

Karci, Mehmet Haydar. "Higher Order Levelable Mrf Energy Minimization Via Graph Cuts." Phd thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609408/index.pdf.

Full text

Abstract:

A feature of minimizing images of a class of binary Markov random field energies is introduced and proved. Using this, the collection of minimizing images of levels of higher order, levelable MRF energies is shown to be a monotone collection. This implies that these images can be combined to give minimizing images of the MRF energy itself. Due to the recent developments, second and third order binary MRF energies of the mentioned class are known to be exactly minimized by maximum flow/minimum cut computations on appropriately constructed graphs. With the aid of these developments an exact and

APA, Harvard, Vancouver, ISO, and other styles

4

Altner, Douglas S. "Advancements on problems involving maximum flows." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24828.

Full text

Abstract:

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008.<br>Committee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.

APA, Harvard, Vancouver, ISO, and other styles

5

Levine, Matthew S. (Matthew Steven). "Experimental study of minimum cut algorithms." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42665.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (p. [123]-126).<br>by Matthew S. Levine.<br>M.S.

APA, Harvard, Vancouver, ISO, and other styles

6

Malioutov, Igor (Igor Mikhailovich). "Minimum cut model for spoken lecture segmentation." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/51651.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2007.<br>Includes bibliographical references (leaves 129-132).<br>We introduce a novel unsupervised algorithm for text segmentation. We re-conceptualize text segmentation as a graph-partitioning task aiming to optimize the normalized-cut criterion. Central to this framework is a contrastive analysis of lexical distribution that simultaneously optimizes the total similarity within each segment and dissimilarity across segments. Our experimental results show that the normalized-cu

APA, Harvard, Vancouver, ISO, and other styles

7

Fügenschuh, Marzena. "Relaxations and solutions for the minimum graph bisection problem /." Berlin : Logos-Verl, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3025314&prov=M&dok_var=1&dok_ext=htm.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Padmaraju, Suneel Gandhi. "Minimum cut based partitioning for sensor insertion to tackle soft errors /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1456292281&sid=7&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shin, David (David Donghun). "A computational study of a geometric embedding of minimum multiway cut." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37070.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.<br>Includes bibliographical references (p. 77-78).<br>In the minimum multiway cut problem, the goal is to find a minimum cost set of edges whose removal disconnects a certain set of k distinguished vertices in a graph. The problem is MAX-SNP hard for k >/= 3. Clinescu, Karloff, and Rabani gave a geometric relaxation of the problem and a rounding scheme, to produce an approximation algorithm that has a performance guarantee of 3/2 - 1/k. In a subsequent study, Karger, Klein, Stei

APA, Harvard, Vancouver, ISO, and other styles

10

Hartmann, Tanja [Verfasser], and D. [Akademischer Betreuer] Wagner. "Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering / Tanja Hartmann. Betreuer: D. Wagner." Karlsruhe : KIT-Bibliothek, 2014. http://d-nb.info/1064504167/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Minimum Cuts"

1

Fiszbein, Ariel. Do workers in the informal sector benefit from cuts in the minimum wage? Country Dept. I, Latin America and the Caribbean Regional Office, the World Bank, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Karya, BP Bhina. Peraturan Menteri Tenaga Kerja dan Transmigrasi Republik Indonesia tentang keputusan bersama Menteri Agama, Menteri Tenaga Kerja dan Transmigrasi, dan Menteri Pendayagunaan Aparatur Negara dan Birokrasi Republik Indonesia no. 5 tahun 2013, no. 225 tahun 2013, nomor: 05/SKB/Menpan-RB/08/2013 tentang hari libur nasional dan cuti bersama tahun 2014, Peraturan Menteri Tenaga Kerja dan Transmigrasi Republik Indonesia nomor 7 tahun 2013 tentang upah minimum: Dilengkapi Instruksi Presiden Republik Indonesia nomor: 9 tahun 2013 tentang kebijakan penetapan upah minimum dalam rangka kerberlangsungan usaha dan peningkatan kesejahteraan pekerja, Peraturan Presiden Republik Indonesia nomor: 12 tahun 213 tentang jaminan kesehatan. Bhina Karya, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Karya, BP Bhina. Peraturan ketenagakerjaan Republik Indonesia tentang penetapan upah minimum dan hari-hari libur nasional dan cuti bersama tahun 2008, pedoman penyelesaian kasus kecelakaan kerja dan penyakit akibat kerja, petunjuk teknis pendaftaran kepesertaan, pembayaran iuran, pembayaran santunan, dan pelayanan jaminan sosial tenaga kerja: Dilengkapi pemanfaatan tenaga kerja asing dan program alih pengetahuan di sektor perbankan, pemberantasan tindak pidana perdagangan orang, impor, dan atau penyerahan barang kena pajak tertentu yang bersifat strategis yang dibebaskan dari pengenaan pajak pertambahan nilai. Bhina Karya, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Karya, BP Bhina. Peraturan ketenagakerjaan Republik Indonesia tentang penetapan upah minimum dan hari-hari libur nasional dan cuti bersama tahun 2008, pedoman penyelesaian kasus kecelakaan kerja dan penyakit akibat kerja, petunjuk teknis pendaftaran kepesertaan, pembayaran iuran, pembayaran santunan, dan pelayanan jaminan sosial tenaga kerja: Dilengkapi pemanfaatan tenaga kerja asing dan program alih pengetahuan di sektor perbankan, pemberantasan tindak pidana perdagangan orang, impor, dan atau penyerahan barang kena pajak tertentu yang bersifat strategis yang dibebaskan dari pengenaan pajak pertambahan nilai. Bhina Karya, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

An Algorithm for Enumerating the Near-Minimum Weight S-T Cuts of a Graph. Storming Media, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Natali, Luisa, and Chiara Saraceno. The Impact of the Great Recession on Child Poverty: The Case of Italy. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198797968.003.0008.

Full text

Abstract:

The duration and depth of the crisis in Italy were largely a consequence of long-term structural features of the Italian economy and of its weak and fragmented social safety net, together with an over-reliance on the capability of family solidarity. The crisis most affected those children that also before showed higher poverty rates: children living in large, often single earner households, particularly in the South, in lone parent and in migrant households. Poor children were also most affected by financial cuts in education, social, and health services implemented under the austerity measure

APA, Harvard, Vancouver, ISO, and other styles

7

Cockett, J. R. B., and R. A. G. Seely. Proof Theory of the Cut Rule. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198748991.003.0010.

Full text

Abstract:

This chapter describes the categorical proof theory of the cut rule, a very basic component of any sequent-style presentation of a logic, assuming a minimum of structural rules and connectives, in fact, starting with none. It is shown how logical features can be added to this basic logic in a modular fashion, at each stage showing the appropriate corresponding categorical semantics of the proof theory, starting with multicategories, and moving to linearly distributive categories and *-autonomous categories. A key tool is the use of graphical representations of proofs (“proof circuits”) to repr

APA, Harvard, Vancouver, ISO, and other styles

8

Kochs, Hans-Dieter. Dependability of Engineering Systems: A Markov Minimal Cut Approach. Springer, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Martin, Graham R. Birds Underwater: A Paucity of Information. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199694532.003.0007.

Full text

Abstract:

Entering beneath the water surface produces a radical change in perceptual challenges. The eye is no longer able to focus adequately and, with increasing depth, light levels decrease and the spectral properties of ambient light narrows with the result that visual resolution decreases rapidly and colour cues are lost. Diving to depth is rapid which means that perceptual challenges change constantly. This results in a paucity of visual information and olfaction and hearing cannot be used to complement this loss. Amphibious foragers must rely upon minimal cues and very specialized foraging behavi

APA, Harvard, Vancouver, ISO, and other styles

10

Mills, M. G. L., and M. E. J. Mills. Breeding, cub survival, and female reproductive success. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198712145.003.0011.

Full text

Abstract:

Cheetahs are aseasonal breeders, with a weak tendency towards seasonality corresponding to the birth peak in springbok lambs. Cub survival from birth to adolescence was 31.3% compared with 4.8% in the Serengeti. Predation was the major cause of cub mortality in the den, but it was usually impossible to identify the predator. The low survival of cheetah cubs recorded on the Serengeti Plains may be exceptional; in the den, apart from predation, starvation through desertion due to the migratory nature of the prey may sometimes occur; on leaving the den the extremely open landscape may make them e

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Minimum Cuts"

1

Fürnkranz, Johannes, Philip K. Chan, Susan Craw, et al. "Minimum Cuts." In Encyclopedia of Machine Learning. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Geissmann, Barbara, and Rastislav Šrámek. "Finding Robust Minimum Cuts." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07956-1_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Armon, Amitai, and Uri Zwick. "Multicriteria Global Minimum Cuts." In Algorithms and Computation. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30551-4_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Henzinger, Monika Rauch. "Approximating minimum cuts under insertions." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60084-1_81.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kapoor, Sanjiv. "On minimum 3-cuts and approximating k-cuts using Cut Trees." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61310-2_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chambers, Erin W., Jeff Erickson, Kyle Fox, and Amir Nayyeri. "Global Minimum Cuts in Surface-Embedded Graphs." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_683.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chambers, Erin W., Jeff Erickson, Kyle Fox, and Amir Nayyeri. "Global Minimum Cuts in Surface-Embedded Graphs." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_683-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhao, Liang, Hiroshi Nagamochi, and Toshihide Ibaraki. "Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts." In Algorithms and Computation. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46632-0_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Strang, Gilbert. "Maximum Flows and Minimum Cuts in the Plane." In Advances in Mechanics and Mathematics. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-75714-8_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bezáková, Ivona, and Zachary Langley. "Minimum Planar Multi-sink Cuts with Connectivity Priors." In Mathematical Foundations of Computer Science 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44465-8_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Minimum Cuts"

1

Henzinger, Monika, Alexander Noe, and Christian Schulz. "Shared-Memory Exact Minimum Cuts." In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2019. http://dx.doi.org/10.1109/ipdps.2019.00013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chekuri, Chandra, and Chao Xu. "Computing minimum cuts in hypergraphs." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.70.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Räcke, Harald, Roy Schwartz, and Richard Stotz. "Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection." In SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 2018. http://dx.doi.org/10.1145/3210377.3210398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Karger, David R. "Minimum cuts in near-linear time." In the twenty-eighth annual ACM symposium. ACM Press, 1996. http://dx.doi.org/10.1145/237814.237829.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chambers, Erin W., Jeff Erickson, and Amir Nayyeri. "Minimum cuts and shortest homologous cycles." In the 25th annual symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Karger, David R., and Clifford Stein. "An Õ(n2) algorithm for minimum cuts." In the twenty-fifth annual ACM symposium. ACM Press, 1993. http://dx.doi.org/10.1145/167088.167281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Park, James K., and Cynthia A. Phillips. "Finding minimum-quotient cuts in planar graphs." In the twenty-fifth annual ACM symposium. ACM Press, 1993. http://dx.doi.org/10.1145/167088.167284.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Neumann, Frank, Joachim Reichel, and Martin Skutella. "Computing minimum cuts by randomized search heuristics." In the 10th annual conference. ACM Press, 2008. http://dx.doi.org/10.1145/1389095.1389250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Russell, D. M., and S. Gong. "Minimum Cuts of A Time-Varying Background." In British Machine Vision Conference 2006. British Machine Vision Association, 2006. http://dx.doi.org/10.5244/c.20.83.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Erickson, Jeff, Kyle Fox, and Amir Nayyeri. "Global Minimum Cuts in Surface Embedded Graphs." In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.103.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Minimum Cuts"

1

Baldo, Jr, and James. Minimum Requirements for the CUS (Common User Subsystem) Workstation. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada199008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Patel, Reena. Complex network analysis for early detection of failure mechanisms in resilient bio-structures. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41042.

Full text

Abstract:

Bio-structures owe their remarkable mechanical properties to their hierarchical geometrical arrangement as well as heterogeneous material properties. This dissertation presents an integrated, interdisciplinary approach that employs computational mechanics combined with flow network analysis to gain fundamental insights into the failure mechanisms of high performance, light-weight, structured composites by examining the stress flow patterns formed in the nascent stages of loading for the rostrum of the paddlefish. The data required for the flow network analysis was generated from the finite ele

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!