Journal articles on the topic 'Minimal cut'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Minimal cut.'
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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Samodivkin, Vladmir. "Minimal acyclic dominating sets and cut-vertices." Mathematica Bohemica 130, no. 1 (2005): 81–88. http://dx.doi.org/10.21136/mb.2005.134216.
Full textKromodimoeljo, Sentot, and Peter A. Lindsay. "Automatic Generation of Minimal Cut Sets." Electronic Proceedings in Theoretical Computer Science 184 (June 10, 2015): 33–47. http://dx.doi.org/10.4204/eptcs.184.3.
Full textKara‐Zaitri, Chakib. "An improved minimal cut set algorithm." International Journal of Quality & Reliability Management 13, no. 2 (1996): 114–32. http://dx.doi.org/10.1108/02656719610110069.
Full textZOLER, MITCHEL L. "Brivaracetam Cut Seizures With Minimal Side Effects." Clinical Neurology News 3, no. 12 (2007): 1–2. http://dx.doi.org/10.1016/s1553-3212(08)70004-9.
Full textHua, Hao, and Tingli Jia. "Wire cut of double-sided minimal surfaces." Visual Computer 34, no. 6-8 (2018): 985–95. http://dx.doi.org/10.1007/s00371-018-1548-0.
Full textBasu, Amitabh, Robert Hildebrand, and Marco Molinaro. "Minimal cut-generating functions are nearly extreme." Mathematical Programming 172, no. 1-2 (2017): 329–49. http://dx.doi.org/10.1007/s10107-017-1153-4.
Full textSkrobanek, Paweł. "Minimal cut sets with time dependencies analysis." Automatyka/Automatics 17, no. 2 (2013): 219. http://dx.doi.org/10.7494/automat.2013.17.2.219.
Full textKlamt, S., and E. D. Gilles. "Minimal cut sets in biochemical reaction networks." Bioinformatics 20, no. 2 (2004): 226–34. http://dx.doi.org/10.1093/bioinformatics/btg395.
Full textKozyra, Paweł Marcin. "Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems." Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 234, no. 5 (2020): 686–95. http://dx.doi.org/10.1177/1748006x20922083.
Full textChe, Yanbo, Yuancheng Zhao, Jianmei Xu, and Jinhuan Zhou. "A Hierarchical Approach for Fast Calculating Minimal Cut Sets of a Microgrid." Mathematical Problems in Engineering 2017 (2017): 1–8. http://dx.doi.org/10.1155/2017/5154740.
Full textChaux, Pierre-Yves, Jean-Marc Roussel, Jean-Jacques Lesage, Gilles Deleuze, and Marc Bouissou. "Towards a unified definition of Minimal Cut Sequences." IFAC Proceedings Volumes 46, no. 22 (2013): 1–6. http://dx.doi.org/10.3182/20130904-3-uk-4041.00013.
Full textVatn, Jørn. "Finding minimal cut sets in a fault tree." Reliability Engineering & System Safety 36, no. 1 (1992): 59–62. http://dx.doi.org/10.1016/0951-8320(92)90152-b.
Full textMardapi, Djemari, Samsul Hadi, and Heri Retnawati. "MENENTUKAN KRITERIA KETUNTASAN MINIMAL BERBASIS PESERTA DIDIK." Jurnal Penelitian dan Evaluasi Pendidikan 19, no. 1 (2015): 38–45. http://dx.doi.org/10.21831/pep.v19i1.4553.
Full textBagheri, Hadi, and Sepideh Abbaszadeh. "Effect of Cold Plasma on Quality Retention of Fresh-Cut Produce." Journal of Food Quality 2020 (December 7, 2020): 1–8. http://dx.doi.org/10.1155/2020/8866369.
Full textZhang, Hong Lin, Chun Yuan Zhang, Dong Liu, and Ying Hong Wang. "Generation of Extended Cut Sequence Set for Dynamic Fault Tree." Advanced Materials Research 143-144 (October 2010): 211–15. http://dx.doi.org/10.4028/www.scientific.net/amr.143-144.211.
Full textMaulidia, Lisa, Rita Khatir, and Ratna Ratna. "Pengaruh Bentuk Irisan Nanas Terhadap Mutu Simpan Terolah Minimal." Jurnal Ilmiah Mahasiswa Pertanian 2, no. 3 (2017): 266–75. http://dx.doi.org/10.17969/jimfp.v2i3.4135.
Full textMiraskarshahi, Reza, Hooman Zabeti, Tamon Stephen, and Leonid Chindelevitch. "MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks." Bioinformatics 35, no. 14 (2019): i615—i623. http://dx.doi.org/10.1093/bioinformatics/btz393.
Full textHua, Hao, and Tingli Jia. "Correction to: Wire cut of double-sided minimal surfaces." Visual Computer 36, no. 1 (2019): 227–28. http://dx.doi.org/10.1007/s00371-019-01629-2.
Full textJobson, Adam S., André E. Kézdy, and Jenő Lehel. "Minimal 2-connected graphs satisfying the even cut condition." Information Processing Letters 167 (April 2021): 106080. http://dx.doi.org/10.1016/j.ipl.2020.106080.
Full textKlamt, Steffen. "Generalized concept of minimal cut sets in biochemical networks." Biosystems 83, no. 2-3 (2006): 233–47. http://dx.doi.org/10.1016/j.biosystems.2005.04.009.
Full textBanov, Reni, and Zdenko Šimić. "On Minimal Cut Sets Representation with Binary Decision Diagrams." Journal of Energy - Energija 71, no. 4 (2023): 12–15. http://dx.doi.org/10.37798/2022714420.
Full textToivonen, Peter M. A. "Application of 1-Methylcyclopropene in Fresh-cut/Minimal Processing Systems." HortScience 43, no. 1 (2008): 102–5. http://dx.doi.org/10.21273/hortsci.43.1.102.
Full textDuan, Rong Xing, Ji Liang Tu, and De Cun Dong. "Intelligent Fault Diagnosis Method Based on Reliability Analysis." Applied Mechanics and Materials 34-35 (October 2010): 487–91. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.487.
Full textTressl, Marcus. "Model completeness of o-minimal structures expanded by Dedekind cuts." Journal of Symbolic Logic 70, no. 1 (2005): 29–60. http://dx.doi.org/10.2178/jsl/1107298509.
Full textEldessouki, Ihab A., Ola Khorshid, Eman Kandeel, and Nasr Lahloubi. "Minimal Residual Disease In Adult AML." Blood 122, no. 21 (2013): 4969. http://dx.doi.org/10.1182/blood.v122.21.4969.4969.
Full textFadhil, Roaa Aziz, and Zahir Abdul Haddi Hassan. "Simple method to extract minimal cut sets of a direct network." Journal of Interdisciplinary Mathematics 26, no. 5 (2023): 903–8. http://dx.doi.org/10.47974/jim-1527.
Full textMutar, Emad Kareem. "Matrix-based Minimal Cut Method and Applications to System Reliability." Advances in Science, Technology and Engineering Systems Journal 5, no. 5 (2020): 991–96. http://dx.doi.org/10.25046/aj0505121.
Full textJungreuthmayer, Christian, Govind Nair, Steffen Klamt, and Jürgen Zanghellini. "Comparison and improvement of algorithms for computing minimal cut sets." BMC Bioinformatics 14, no. 1 (2013): 318. http://dx.doi.org/10.1186/1471-2105-14-318.
Full textHao, Zhifeng, Wei-Chang Yeh, and Cheng-Feng Hu. "A Novel Multistate Minimal Cut Vectors Problem and Its Algorithm." IEEE Transactions on Reliability 68, no. 1 (2019): 291–301. http://dx.doi.org/10.1109/tr.2018.2867103.
Full textNiu, Yi-Feng, and Xiu-Zhen Xu. "A New Solution Algorithm for the Multistate Minimal Cut Problem." IEEE Transactions on Reliability 69, no. 3 (2020): 1064–76. http://dx.doi.org/10.1109/tr.2019.2935630.
Full textFard, Nasser S. "Determination of minimal cut sets of a complex fault tree." Computers & Industrial Engineering 33, no. 1-2 (1997): 59–62. http://dx.doi.org/10.1016/s0360-8352(97)00041-7.
Full textHädicke, Oliver, and Steffen Klamt. "Computing complex metabolic intervention strategies using constrained minimal cut sets." Metabolic Engineering 13, no. 2 (2011): 204–13. http://dx.doi.org/10.1016/j.ymben.2010.12.004.
Full textMahadevan, Radhakrishnan, Axel von Kamp, and Steffen Klamt. "Genome-scale strain designs based on regulatory minimal cut sets." Bioinformatics 31, no. 17 (2015): 2844–51. http://dx.doi.org/10.1093/bioinformatics/btv217.
Full textProsvirnova, Tatiana, and Antoine Rauzy. "Automated generation of minimal cut sets from AltaRica 3.0 models." International Journal of Critical Computer-Based Systems 6, no. 1 (2015): 50. http://dx.doi.org/10.1504/ijccbs.2015.068852.
Full textWu, Y., and C. Li. "Minimal cost project networks: The cut set parallel difference method." Omega 22, no. 4 (1994): 401—IN2. http://dx.doi.org/10.1016/0305-0483(94)90066-3.
Full textRosenberg, Ladislav. "Algorithm for finding minimal cut sets in a fault tree." Reliability Engineering & System Safety 53, no. 1 (1996): 67–71. http://dx.doi.org/10.1016/0951-8320(96)00034-8.
Full textLamalem, Yasser, Khalid Housni, and Samir Mbarki. "Enumeration of the minimal node cutsets based on necessary minimal paths." IAES International Journal of Artificial Intelligence (IJ-AI) 9, no. 2 (2020): 175. http://dx.doi.org/10.11591/ijai.v9.i2.pp175-182.
Full textStorch, Borys, Anna Zawada-Tomkiewicz, and Łukasz Żurawski. "Minimal thickness of cut layer in the vicinity of the cutting edge rounding." Mechanik 91, no. 10 (2018): 889–91. http://dx.doi.org/10.17814/mechanik.2018.10.154.
Full textLarraz, Daniel. "Finding Locally Smallest Cut Sets using Max-SMT." ACM SIGAda Ada Letters 42, no. 2 (2023): 32–39. http://dx.doi.org/10.1145/3591335.3591337.
Full textKvassay, Miroslav, and Jozef Kostolny. "Evaluation of Algorithms for Identification of Minimal Cut Vectors and Minimal Path Vectors in Multi-State Systems." Communications - Scientific letters of the University of Zilina 17, no. 4 (2015): 8–14. http://dx.doi.org/10.26552/com.c.2015.4.8-14.
Full textHuang, Ding-Hsiang, Cheng-Fu Huang, and Yi-Kuei Lin. "A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks." European Journal of Operational Research 282, no. 3 (2020): 1107–14. http://dx.doi.org/10.1016/j.ejor.2019.10.030.
Full textDong-Kui, Li, and Chi Hang-Zhong. "A new algorithm for reliability evaluation of three-state device complex networks: Minimal cut-minimal path method." Microelectronics Reliability 34, no. 9 (1994): 1537–40. http://dx.doi.org/10.1016/0026-2714(94)90464-2.
Full textMiceli, Claudia, Alessandra Moncada, Filippo Vetrano, Fabio D’Anna, and Alessandro Miceli. "Suitability of Borago officinalis for Minimal Processing as Fresh-Cut Produce." Horticulturae 5, no. 4 (2019): 66. http://dx.doi.org/10.3390/horticulturae5040066.
Full textVoroshilov, V. V. "Complexity of the max cut Problem with the Minimal Domination Constraint." Journal of Applied and Industrial Mathematics 16, no. 1 (2022): 168–74. http://dx.doi.org/10.1134/s1990478922010161.
Full textVoroshilov, V. V. "Complexity of the max cut problem with the minimal domination constraint." Diskretnyi analiz i issledovanie operatsii 29, no. 1 (2022): 5–17. http://dx.doi.org/10.33048/daio.2022.29.706.
Full textYuge, Tetsushi, Taijiro Yoneda, Nobuyuki Tamura, and Shigeru Yanagi. "Minimal cut sequences and top event probability of dynamic fault tree." Journal of Quality in Maintenance Engineering 19, no. 1 (2013): 38–49. http://dx.doi.org/10.1108/13552511311304465.
Full textDecavel, P., F. Michel, T. Moulin, B. Parratte, and Y. Sagawa Junior. "Does fampridine overpass gait cut-offs based on minimal detectable change?" Annals of Physical and Rehabilitation Medicine 61 (July 2018): e246. http://dx.doi.org/10.1016/j.rehab.2018.05.572.
Full textApaolaza, Iñigo, Luis Vitores Valcarcel, and Francisco J. Planes. "gMCS: fast computation of genetic minimal cut sets in large networks." Bioinformatics 35, no. 3 (2018): 535–37. http://dx.doi.org/10.1093/bioinformatics/bty656.
Full textChanda, R. S., and P. K. Bhattacharjee. "A reliability approach to transmission expansion planning using minimal cut theory." Electric Power Systems Research 33, no. 2 (1995): 111–17. http://dx.doi.org/10.1016/0378-7796(95)00937-d.
Full textRebaiaia, Mohamed-Larbi, and Daoud Ait-Kadi. "A New Technique for Generating Minimal Cut Sets in Nontrivial Network." AASRI Procedia 5 (2013): 67–76. http://dx.doi.org/10.1016/j.aasri.2013.10.060.
Full text