Статті в журналах з теми "Interval digraphs"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Interval digraphs".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Feder, Tomás, Pavol Hell, Jing Huang, and Arash Rafiey. "Adjusted Interval Digraphs." Electronic Notes in Discrete Mathematics 32 (March 2009): 83–91. http://dx.doi.org/10.1016/j.endm.2009.02.012.
Повний текст джерелаDas, S., M. Sen, A. B. Roy, and D. B. West. "Interval digraphs: An analogue of interval graphs." Journal of Graph Theory 13, no. 2 (June 1989): 189–202. http://dx.doi.org/10.1002/jgt.3190130206.
Повний текст джерелаPrisner, Erich. "Algorithms for interval catch digraphs." Discrete Applied Mathematics 51, no. 1-2 (June 1994): 147–57. http://dx.doi.org/10.1016/0166-218x(94)90104-x.
Повний текст джерелаWest, Douglas B. "Short proofs for interval digraphs." Discrete Mathematics 178, no. 1-3 (January 1998): 287–92. http://dx.doi.org/10.1016/s0012-365x(97)81840-7.
Повний текст джерелаSen, Malay, P. Talukdar, and Sandip Das. "Chronological orderings of interval digraphs." Discrete Mathematics 306, no. 14 (July 2006): 1601–9. http://dx.doi.org/10.1016/j.disc.2005.11.032.
Повний текст джерелаPrisner, Erich. "A characterization of interval catch digraphs." Discrete Mathematics 73, no. 3 (1989): 285–89. http://dx.doi.org/10.1016/0012-365x(89)90271-9.
Повний текст джерелаDas, Ashok Kumar, Sandip Das, and Malay Sen. "Forbidden substructure for interval digraphs/bigraphs." Discrete Mathematics 339, no. 2 (February 2016): 1028–51. http://dx.doi.org/10.1016/j.disc.2015.10.010.
Повний текст джерелаMüller, Haiko. "Recognizing interval digraphs and interval bigraphs in polynomial time." Discrete Applied Mathematics 78, no. 1-3 (October 1997): 189–205. http://dx.doi.org/10.1016/s0166-218x(97)00027-9.
Повний текст джерелаFeder, Tomás, Pavol Hell, Jing Huang, and Arash Rafiey. "Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms." Discrete Applied Mathematics 160, no. 6 (April 2012): 697–707. http://dx.doi.org/10.1016/j.dam.2011.04.016.
Повний текст джерелаTakaoka, Asahi. "A recognition algorithm for adjusted interval digraphs." Discrete Applied Mathematics 294 (May 2021): 253–56. http://dx.doi.org/10.1016/j.dam.2021.02.014.
Повний текст джерелаPaul, Sanchita, and Shamik Ghosh. "On some subclasses of interval catch digraphs." Electronic Journal of Graph Theory and Applications 10, no. 1 (March 20, 2022): 157. http://dx.doi.org/10.5614/ejgta.2022.10.1.10.
Повний текст джерелаHell, Pavol, and Arash Rafiey. "Monotone Proper Interval Digraphs and Min-Max Orderings." SIAM Journal on Discrete Mathematics 26, no. 4 (January 2012): 1576–96. http://dx.doi.org/10.1137/100783844.
Повний текст джерелаCho, Han Hyuk, and Suh-Ryung Kim. "A class of acyclic digraphs with interval competition graphs." Discrete Applied Mathematics 148, no. 2 (May 2005): 171–80. http://dx.doi.org/10.1016/j.dam.2005.02.005.
Повний текст джерелаMeng, Deyuan, Mingjun Du, and Yingmin Jia. "Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs." IEEE Transactions on Automatic Control 61, no. 12 (December 2016): 3755–70. http://dx.doi.org/10.1109/tac.2016.2528539.
Повний текст джерелаPavlenko, V. A. "Number of digraphs of periodic points of a continuous mapping of an interval into itself." Ukrainian Mathematical Journal 39, no. 5 (1988): 481–86. http://dx.doi.org/10.1007/bf01066460.
Повний текст джерелаAbdulla, Ugur G., Rashad U. Abdulla, Muhammad U. Abdulla, and Naveed H. Iqbal. "Second Minimal Orbits, Sharkovski Ordering and Universality in Chaos." International Journal of Bifurcation and Chaos 27, no. 05 (May 2017): 1730018. http://dx.doi.org/10.1142/s021812741730018x.
Повний текст джерелаTalukdar, Malay Sen P., and Sandip Das. "Chronological Orderings of Interval Digraph." Electronic Notes in Discrete Mathematics 15 (May 2003): 182–85. http://dx.doi.org/10.1016/s1571-0653(04)00574-8.
Повний текст джерелаSen, Malay K., B. K. Sanyal, and Douglas B. West. "Representing digraphs using intervals or circular arcs." Discrete Mathematics 147, no. 1-3 (December 1995): 235–45. http://dx.doi.org/10.1016/0012-365x(94)00167-h.
Повний текст джерелаSanyal, Barun K., and Malay K. Sen. "New characterizations of digraphs represented by intervals." Journal of Graph Theory 22, no. 4 (August 1996): 297–303. http://dx.doi.org/10.1002/(sici)1097-0118(199608)22:4<297::aid-jgt3>3.0.co;2-g.
Повний текст джерелаDas, Ashok Kumar, and Ritapa Chakraborty. "Graphs and digraphs represented by intervals and circular arcs." Discrete Applied Mathematics 228 (September 2017): 41–49. http://dx.doi.org/10.1016/j.dam.2016.11.004.
Повний текст джерелаTian, Gui-Xian, Ting-Zhu Huang, and Shu-Yu Cui. "The digraphs and inclusion intervals of matrix singular values." Numerical Linear Algebra with Applications 16, no. 8 (August 2009): 677–87. http://dx.doi.org/10.1002/nla.638.
Повний текст джерелаMartins-Ferreira, Nelson. "Internal Categorical Structures and Their Applications." Mathematics 11, no. 3 (January 28, 2023): 660. http://dx.doi.org/10.3390/math11030660.
Повний текст джерелаLi, Jiong-sheng, Kai Yang, and Qing-xue Wang. "Digraphs and Inclusion Intervals of Brualdi-type for Singular Values." Acta Mathematicae Applicatae Sinica, English Series 18, no. 3 (September 2002): 471–76. http://dx.doi.org/10.1007/s102550200047.
Повний текст джерелаDas, S., and M. Sen. "An interval digraph in relation to its associated bipartite graph." Discrete Mathematics 122, no. 1-3 (November 1993): 113–36. http://dx.doi.org/10.1016/0012-365x(93)90290-a.
Повний текст джерелаHetmańczyk, Mariusz Piotr. "The Reliability Model of AC-Asynchronous Drive Based on the Multilevel Prognosis System Supported by Matrices and Digraphs Methods." Solid State Phenomena 199 (March 2013): 85–90. http://dx.doi.org/10.4028/www.scientific.net/ssp.199.85.
Повний текст джерелаPramanik, Tarasankar, G. Muhiuddin, Abdulaziz M. Alanazi, and Madhumangal Pal. "An Extension of Fuzzy Competition Graph and Its Uses in Manufacturing Industries." Mathematics 8, no. 6 (June 19, 2020): 1008. http://dx.doi.org/10.3390/math8061008.
Повний текст джерелаPamplona, Jill Maegan B., and Imelda S. Aniversario. "On the Planarity of a Directed Pathos Total Digraphs of Some Special Arborescence Graphs." European Journal of Pure and Applied Mathematics 15, no. 3 (July 31, 2022): 1331–43. http://dx.doi.org/10.29020/nybg.ejpam.v15i3.4492.
Повний текст джерелаABRAMS, AARON, ERIC BABSON, HENRY LANDAU, ZEPH LANDAU, and JAMES POMMERSHEIM. "Distributions of Order Patterns of Interval Maps." Combinatorics, Probability and Computing 22, no. 3 (March 5, 2013): 319–41. http://dx.doi.org/10.1017/s0963548313000035.
Повний текст джерелаBountourelis, Theologos, and Spyros Reveliotis. "Optimal Node Visitation in Acyclic Stochastic Digraphs with Multi-threaded Traversals and Internal Visitation Requirements." Discrete Event Dynamic Systems 19, no. 3 (February 19, 2009): 347–76. http://dx.doi.org/10.1007/s10626-009-0065-8.
Повний текст джерелаCeyhan, Elvan. "Domination number of an interval catch digraph family and its use for testing uniformity." Statistics 54, no. 2 (January 29, 2020): 310–39. http://dx.doi.org/10.1080/02331888.2020.1720020.
Повний текст джерелаGorelov, D. Y., O. O. Ivanova, O. V. Lytvynenko, A. A. Dovbnia, and D. O. Minin. "Study of the possibilities to use keyboard handwriting for the tasks of identifying students in e-learning systems." Radiotekhnika, no. 207 (December 24, 2021): 139–48. http://dx.doi.org/10.30837/rt.2021.4.207.15.
Повний текст джерелаKozerenko, Sergiy. "More on linear and metric tree maps." Opuscula Mathematica 41, no. 1 (2021): 55–70. http://dx.doi.org/10.7494/opmath.2021.41.1.55.
Повний текст джерелаMatsveichuk, N. M., Y. N. Sotskov, and F. Werner. "The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times." Optimization 60, no. 12 (December 2011): 1493–517. http://dx.doi.org/10.1080/02331931003657691.
Повний текст джерелаCeyhan, Elvan. "The distribution of the relative arc density of a family of interval catch digraph based on uniform data." Metrika 75, no. 6 (February 27, 2011): 761–93. http://dx.doi.org/10.1007/s00184-011-0351-y.
Повний текст джерелаMarchenko, S., and O. Ivashchuk. "Control of gas transmission system in non-stationary consumption modes." Journal of Physics: Conference Series 2131, no. 4 (December 1, 2021): 042003. http://dx.doi.org/10.1088/1742-6596/2131/4/042003.
Повний текст джерелаBoesch, F. T., A. Satyanarayana, and C. L. Suffel. "Some Alternate Characterizations of Reliability Domination." Probability in the Engineering and Informational Sciences 4, no. 2 (April 1990): 257–76. http://dx.doi.org/10.1017/s0269964800001571.
Повний текст джерелаKusumastuti, Nilamsari, Raventino, and Fransiskus Fran. "The diachromatic number of double star graph." Journal of Physics: Conference Series 2106, no. 1 (November 1, 2021): 012024. http://dx.doi.org/10.1088/1742-6596/2106/1/012024.
Повний текст джерелаMasrofah, Masrofah, Lolyana Lolyana, Destiani Destiani, and Erni Mustakim. "ANALISIS FAKTOR KESULITAN MEMBACA PESERTA DIDIK DI KELAS RENDAH." Jurnal Kata : Bahasa, Sastra, dan Pembelajarannya 11, no. 1 (2023): 56–65. http://dx.doi.org/10.23960/kata/v11i1.2023.07.
Повний текст джерелаZhilyakova, Liudmila. "Single-Threshold Model Resource Network and Its Double-Threshold Modifications." Mathematics 9, no. 12 (June 21, 2021): 1444. http://dx.doi.org/10.3390/math9121444.
Повний текст джерелаYandybaeva, Natalya V. "Dynamic model for predicting quality of life indicators in the region." Journal Of Applied Informatics 18, no. 1 (February 10, 2023): 129–43. http://dx.doi.org/10.37791/2687-0649-2023-18-1-129-143.
Повний текст джерелаAnnela, Ayu, and Safran Safran. "Analysis of Early Reading Difficulties for Elementary School Students." Scaffolding: Jurnal Pendidikan Islam dan Multikulturalisme 5, no. 2 (July 13, 2023): 466–84. http://dx.doi.org/10.37680/scaffolding.v5i2.3121.
Повний текст джерелаKrivonosov, M. I., A. V. Varekhina, K. V. Anokhin, and M. V. Ivanchenko. "Associations of neuro-glial network calcium activity with mice movements <i>in vivo</i>." Genes & Cells 18, no. 4 (December 15, 2023): 850–53. http://dx.doi.org/10.17816/gc623434.
Повний текст джерелаBenali, Akli, Nuno Guiomar, Hugo Gonçalves, Bernardo Mota, Fábio Silva, Paulo M. Fernandes, Carlos Mota, et al. "The Portuguese Large Wildfire Spread database (PT-FireSprd)." Earth System Science Data 15, no. 8 (August 23, 2023): 3791–818. http://dx.doi.org/10.5194/essd-15-3791-2023.
Повний текст джерелаBoychuk, V., A. Boychuk, M. Boychuk, and O. Burdyug. "THE ACTION SEQUENCE FORMING METHOD FOR INTELLECTUAL AGENTS." Collection of scientific works of the Military Institute of Kyiv National Taras Shevchenko University, no. 66 (2019): 65–74. http://dx.doi.org/10.17721/2519-481x/2020/66-07.
Повний текст джерелаPetrushenko, N. "Spatio-temporal combinatorics of resource flows conservation and reduction of risks in conditions of uncertainty of the external environment." System technologies 1, no. 138 (March 30, 2022): 65–78. http://dx.doi.org/10.34185/1562-9945-1-138-2022-06.
Повний текст джерелаDas, Sandip, Mathew Francis, Pavol Hell, and Jing Huang. "Recognition and Characterization of Chronological Interval Digraphs." Electronic Journal of Combinatorics 20, no. 3 (July 26, 2013). http://dx.doi.org/10.37236/2497.
Повний текст джерелаSeifter, Norbert, and Vladimir I. Trofimov. "Reachability Relations and the Structure of Transitive Digraphs." Electronic Journal of Combinatorics 16, no. 1 (February 27, 2009). http://dx.doi.org/10.37236/115.
Повний текст джерелаAusthof, Bethany, Patrick Bennett, and Nick Christo. "The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0,1/2]$." Electronic Journal of Combinatorics 29, no. 1 (January 28, 2022). http://dx.doi.org/10.37236/10293.
Повний текст джерелаFrancis, Mathew C., Pavol Hell, and Dalu Jacob. "On the Kernel and Related Problems in Interval Digraphs." Algorithmica, July 19, 2022. http://dx.doi.org/10.1007/s00453-022-01010-1.
Повний текст джерелаMeyerowitz, Aaron. "Tiling the Line with Triples." Discrete Mathematics & Theoretical Computer Science DMTCS Proceedings vol. AA,..., Proceedings (January 1, 2001). http://dx.doi.org/10.46298/dmtcs.2282.
Повний текст джерела