Статті в журналах з теми "Graph-based enumeration"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Graph-based enumeration".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Sanei-Mehri, Seyed-Vahid, Apurba Das, Hooman Hashemi, and Srikanta Tirthapura. "Mining Largest Maximal Quasi-Cliques." ACM Transactions on Knowledge Discovery from Data 15, no. 5 (June 26, 2021): 1–21. http://dx.doi.org/10.1145/3446637.
Повний текст джерелаSimoni, Roberto, Andrea Piga Carboni, and Daniel Martins. "Enumeration of parallel manipulators." Robotica 27, no. 4 (July 2009): 589–97. http://dx.doi.org/10.1017/s0263574708004979.
Повний текст джерелаshaik, Fathimabi, RBV Subramanyam, and DVLN Somayajulu. "Map-Reduce based Multiple Sub-Graph Enumeration Using Dominating-Set Graph Partition." International Journal of Information Engineering and Electronic Business 9, no. 2 (March 8, 2017): 36–44. http://dx.doi.org/10.5815/ijieeb.2017.02.05.
Повний текст джерелаTrefftz, Christian, Hugh McGuire, Zachary Kurmas, and Jerry Scripps. "Exhaustive Community Enumeration in Parallel." Parallel Processing Letters 26, no. 02 (June 2016): 1650006. http://dx.doi.org/10.1142/s0129626416500067.
Повний текст джерелаMa, Ming Yue, and Xiang Yang Xu. "A Novel Algorithm for Enumeration of the Planetary Gear Train Based on Graph Theory." Advanced Materials Research 199-200 (February 2011): 392–99. http://dx.doi.org/10.4028/www.scientific.net/amr.199-200.392.
Повний текст джерелаWang, Shanshan, Chenglong Xiao, and Wanjun Liu. "Parallel Enumeration of Custom Instructions Based on Multidepth Graph Partitioning." IEEE Embedded Systems Letters 11, no. 1 (March 2019): 1–4. http://dx.doi.org/10.1109/les.2018.2812784.
Повний текст джерелаChen, Lu, Chengfei Liu, Rui Zhou, Jiajie Xu, and Jianxin Li. "Efficient maximal biclique enumeration for large sparse bipartite graphs." Proceedings of the VLDB Endowment 15, no. 8 (April 2022): 1559–71. http://dx.doi.org/10.14778/3529337.3529341.
Повний текст джерелаKHAKABIMAMAGHANI, SAHAND, MASOOD MASJOODY, and LADISLAV STACHO. "Traversal with Enumeration of Geometric Graphs in Bounded Space." Journal of Interconnection Networks 19, no. 04 (December 2019): 1950008. http://dx.doi.org/10.1142/s0219265919500087.
Повний текст джерелаYang, Yu, An Wang, Hua Wang, Wei-Ting Zhao, and Dao-Qiang Sun. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution." Mathematics 7, no. 5 (May 24, 2019): 472. http://dx.doi.org/10.3390/math7050472.
Повний текст джерелаKruse, Sebastian, Zoi Kaoudi, Bertty Contreras-Rojas, Sanjay Chawla, Felix Naumann, and Jorge-Arnulfo Quiané-Ruiz. "RHEEMix in the data jungle: a cost-based optimizer for cross-platform systems." VLDB Journal 29, no. 6 (May 18, 2020): 1287–310. http://dx.doi.org/10.1007/s00778-020-00612-x.
Повний текст джерелаSimoni, R., A. P. Carboni, and D. Martins. "Enumeration of kinematic chains and mechanisms." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 223, no. 4 (December 1, 2008): 1017–24. http://dx.doi.org/10.1243/09544062jmes1071.
Повний текст джерелаKONDO, Koichi. "Collision avoidance by free space enumeration based on heuristic graph search." Journal of the Robotics Society of Japan 6, no. 6 (1988): 489–98. http://dx.doi.org/10.7210/jrsj.6.6_489.
Повний текст джерелаHaiduc, Ionel. "A Graph-Based Classification and Enumeration of Inorganic Homo- And Heterocycles." Phosphorus, Sulfur, and Silicon and the Related Elements 64, no. 1-4 (January 1992): 169–78. http://dx.doi.org/10.1080/10426509208041143.
Повний текст джерелаKondo, Koichi. "Collision avoidance by free space enumeration based on heuristic graph search." Advanced Robotics 5, no. 3 (January 1990): 293–308. http://dx.doi.org/10.1163/156855391x00214.
Повний текст джерелаPospíchal, Jiří, and Vladimír Kvasnička. "An Alternative Approach for Constructive Enumeration of Graphs." Collection of Czechoslovak Chemical Communications 58, no. 4 (1993): 754–74. http://dx.doi.org/10.1135/cccc19930754.
Повний текст джерелаAmiri, Behzad, Jorg Kliewer, and Lara Dolecek. "Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes." IEEE Transactions on Communications 62, no. 2 (February 2014): 398–409. http://dx.doi.org/10.1109/tcomm.2013.122113.130465.
Повний текст джерелаHAIDUC, I. "ChemInform Abstract: A Graph-Based Classification and Enumeration of Inorganic Homo- and Heterocycles." ChemInform 23, no. 23 (August 22, 2010): no. http://dx.doi.org/10.1002/chin.199223012.
Повний текст джерелаProkopenkov, Vladymyr. "POLYNOMIAL ALGORITHM FOR FINDING A HAMILTONIAN CYCLE ON A GRAPH." Bulletin of NTU "KhPI". Series: Strategic management, portfolio, program and project management, no. 1(3) (April 17, 2021): 55–65. http://dx.doi.org/10.20998/2413-3000.2021.3.8.
Повний текст джерелаJeng, Shyr-Long, Rohit Roy, and Wei-Hua Chieng. "A Matrix Approach for Analyzing Signal Flow Graph." Information 11, no. 12 (November 30, 2020): 562. http://dx.doi.org/10.3390/info11120562.
Повний текст джерелаChen, Wei, Jia Liu, Ziyang Chen, Xian Tang, and Kaiyu Li. "PBSM: An Efficient Top-K Subgraph Matching Algorithm." International Journal of Pattern Recognition and Artificial Intelligence 32, no. 06 (February 21, 2018): 1850020. http://dx.doi.org/10.1142/s0218001418500209.
Повний текст джерелаDeptuła, Adam, Józef Drewniak, and Marian A. Partyka. "Analysis of a planetary gear modeled with a contour graph taking into account the method of parametric play structures." Mechanik 90, no. 7 (July 10, 2017): 640–42. http://dx.doi.org/10.17814/mechanik.2017.7.98.
Повний текст джерелаKim, Donghyun, Hao Guo, Wei Wang, Joong-Lyul Lee, Sung-Sik Kwon, and Alade O. Tokuta. "On efficient vaccine distribution strategy to suppress pandemic using social relation." Discrete Mathematics, Algorithms and Applications 08, no. 01 (February 26, 2016): 1650010. http://dx.doi.org/10.1142/s1793830916500105.
Повний текст джерелаHao, Kongzhang, Long Yuan, and Wenjie Zhang. "Distributed hop-constrained s-t simple path enumeration at billion scale." Proceedings of the VLDB Endowment 15, no. 2 (October 2021): 169–82. http://dx.doi.org/10.14778/3489496.3489499.
Повний текст джерелаIVANOV, DENIS, and ALEXANDER SEMENOV. "TOPOLOGICAL APPROACH TO BLACKHOLES ANOMALY DETECTION IN DIRECTED NETWORKS." Computational nanotechnology 7, no. 2 (June 30, 2020): 49–57. http://dx.doi.org/10.33693/2313-223x-2020-7-2-49-57.
Повний текст джерелаZhu, Wanlin, Minglei Fang, and Xianya Geng. "Enumeration of the Gutman and Schultz indices in the random polygonal chains." Mathematical Biosciences and Engineering 19, no. 11 (2022): 10826–45. http://dx.doi.org/10.3934/mbe.2022506.
Повний текст джерелаLawall, Alexander, and Thomas Schaller. "A Graph-based and Declarative Approach to a Secure Resource Management in Smart Factories." International Journal on Cryptography and Information Security 12, no. 3 (September 30, 2022): 1–11. http://dx.doi.org/10.5121/ijcis.2022.12301.
Повний текст джерелаShang, Yilun. "On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs." Open Mathematics 14, no. 1 (January 1, 2016): 641–48. http://dx.doi.org/10.1515/math-2016-0055.
Повний текст джерелаNazarov, Vadim Igorevich, and Eduard Stanislavovich Klyshinsky. "Graph-based data structure for enumeration of all possible generation scenarios of immune receptor sequences." Keldysh Institute Preprints, no. 108 (2017): 1–30. http://dx.doi.org/10.20948/prepr-2017-108.
Повний текст джерелаJamshidi, Kasra, and Keval Vora. "A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE." ACM SIGOPS Operating Systems Review 55, no. 1 (June 2, 2021): 1–10. http://dx.doi.org/10.1145/3469379.3469381.
Повний текст джерелаXue, Hui-Ling, Geng Liu, and Xiao-Hui Yang. "A review of graph theory application research in gears." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 230, no. 10 (April 16, 2015): 1697–714. http://dx.doi.org/10.1177/0954406215583321.
Повний текст джерелаBatenkov, Kirill. "Accurate and Boundary Estimate of Communication Network Connectivity Probability Based on Model State Complete Enumeration Method." SPIIRAS Proceedings 18, no. 5 (September 19, 2019): 1093–118. http://dx.doi.org/10.15622/sp.2019.18.5.1093-1118.
Повний текст джерелаProkopenkov, Vladymyr. "DEFERRED SOLUTIONS METHOD DEVELOPMENT FOR CONSTRUCTING A HAMILTONIAN CYCLE SEARCH ALGORITHM ON A GRAPH." Bulletin of NTU "KhPI". Series: Strategic management, portfolio, program and project management, no. 1(5) (July 31, 2022): 44–49. http://dx.doi.org/10.20998/2413-3000.2022.5.
Повний текст джерелаPELLEGRINI, FRANÇOIS. "BOUNDS FOR THE BANDWIDTH OF THE d-ARY DE BRUIJN GRAPH." Parallel Processing Letters 03, no. 04 (December 1993): 431–43. http://dx.doi.org/10.1142/s0129626493000460.
Повний текст джерелаBannach, Max, and Sebastian Berndt. "Recent Advances in Positive-Instance Driven Graph Searching." Algorithms 15, no. 2 (January 27, 2022): 42. http://dx.doi.org/10.3390/a15020042.
Повний текст джерелаMosterman, P. J. "HYBRSIM—a modelling and simulation environment for hybrid bond graphs." Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering 216, no. 1 (February 1, 2002): 35–46. http://dx.doi.org/10.1243/0959651021541417.
Повний текст джерелаMADABHUSHI, S. V. R., S. LAKSHMIVARAHAN, and S. K. DHALL. "ANALYSIS OF A CLASS OF NETWORKS BASED ON CUBIC STAR GRAPHS." Journal of Circuits, Systems and Computers 04, no. 02 (June 1994): 191–222. http://dx.doi.org/10.1142/s0218126694000120.
Повний текст джерелаYang, Jianye, Yun Peng, and Wenjie Zhang. "(p,q)-biclique counting and enumeration for large sparse bipartite graphs." Proceedings of the VLDB Endowment 15, no. 2 (October 2021): 141–53. http://dx.doi.org/10.14778/3489496.3489497.
Повний текст джерелаLiu, T. S., and C. C. Chou. "Type Synthesis of Vehicle Planar Suspension Mechanism Using Graph Theory." Journal of Mechanical Design 115, no. 3 (September 1, 1993): 652–57. http://dx.doi.org/10.1115/1.2919240.
Повний текст джерелаDekker, David, David Krackhardt, and Tom A. B. Snijders. "Transitivity correlation: A descriptive measure of network transitivity." Network Science 7, no. 3 (September 2019): 353–75. http://dx.doi.org/10.1017/nws.2019.32.
Повний текст джерелаWang, Zibo, Yaofang Zhang, Zhiyao Liu, Xiaojie Wei, Yilu Chen, and Bailing Wang. "An Automatic Planning-Based Attack Path Discovery Approach from IT to OT Networks." Security and Communication Networks 2021 (October 31, 2021): 1–18. http://dx.doi.org/10.1155/2021/1444182.
Повний текст джерелаOu, Feng-Ming, Hong-Sen Yan, and Ming-Feng Tang. "THE SYNTHESIS OF MECHANISM SYSTEMS USING A MECHANISM CONCEPT LIBRARY." Transactions of the Canadian Society for Mechanical Engineering 34, no. 1 (March 2010): 151–63. http://dx.doi.org/10.1139/tcsme-2010-0010.
Повний текст джерелаChen, Yong Heng, Wan Li Zuo, and Feng Lin He. "Optimization Strategy of Bidirectional Join Enumeration in Multi-Core CPUS." Applied Mechanics and Materials 44-47 (December 2010): 383–87. http://dx.doi.org/10.4028/www.scientific.net/amm.44-47.383.
Повний текст джерелаChang, Yi-Jun, Seth Pettie, Thatchaphol Saranurak, and Hengjie Zhang. "Near-optimal Distributed Triangle Enumeration via Expander Decompositions." Journal of the ACM 68, no. 3 (May 13, 2021): 1–36. http://dx.doi.org/10.1145/3446330.
Повний текст джерелаDias, Ana Paula S., and Eliana Manuel Pinho. "Enumerating periodic patterns of synchrony via finite bidirectional networks." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 466, no. 2115 (November 16, 2009): 891–910. http://dx.doi.org/10.1098/rspa.2009.0404.
Повний текст джерелаPavlenko, Yevhen, Vladimir Butenko, Vadim Gubin, and Serhii Lubenets. "RESEARCH OF DATA TYPE CLASSIFICATION METHODS WHEN DEVELOPING COMPUTER ENGINEERING SOFTWARE." Bulletin of National Technical University "KhPI". Series: System Analysis, Control and Information Technologies, no. 1 (5) (July 12, 2021): 80–85. http://dx.doi.org/10.20998/2079-0023.2021.01.13.
Повний текст джерелаMontes, Carlos, Zoran Kapelan, and Juan Saldarriaga. "Impact of Self-Cleansing Criteria Choice on the Optimal Design of Sewer Networks in South America." Water 11, no. 6 (May 31, 2019): 1148. http://dx.doi.org/10.3390/w11061148.
Повний текст джерелаHasan, Zafar, and Maciej J. Ciesielski. "FSM Decomposition and Functional Verification of FSM Networks." VLSI Design 3, no. 3-4 (January 1, 1995): 249–65. http://dx.doi.org/10.1155/1995/62636.
Повний текст джерелаDANIEL, FREDERIC, and GERARD AUTHIÉ. "SHORTEST PATHS MULTIPLICITY IN GENERALIZED DE BRUIJN AND KAUTZ NETWORKS." Parallel Processing Letters 03, no. 04 (December 1993): 363–74. http://dx.doi.org/10.1142/s012962649300040x.
Повний текст джерелаŞeker, Oylum, Pinar Heggernes, Tinaz Ekim, and Z. Caner Taşkın. "Generation of random chordal graphs using subtrees of a tree." RAIRO - Operations Research 56, no. 2 (March 2022): 565–82. http://dx.doi.org/10.1051/ro/2022027.
Повний текст джерелаAzam, Naveed Ahmed, Aleksandar Shurbevski, and Hiroshi Nagamochi. "An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops." Entropy 22, no. 9 (August 22, 2020): 923. http://dx.doi.org/10.3390/e22090923.
Повний текст джерела