Статті в журналах з теми "Subgraph Counting"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Subgraph Counting".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ribeiro, Pedro, Pedro Paredes, Miguel E. P. Silva, David Aparicio, and Fernando Silva. "A Survey on Subgraph Counting." ACM Computing Surveys 54, no. 2 (April 2021): 1–36. http://dx.doi.org/10.1145/3433652.
Повний текст джерелаZhang, Hao, Jeffrey Xu Yu, Yikai Zhang, Kangfei Zhao, and Hong Cheng. "Distributed subgraph counting." Proceedings of the VLDB Endowment 13, no. 12 (August 2020): 2493–507. http://dx.doi.org/10.14778/3407790.3407840.
Повний текст джерелаSze, Lawrence. "The number of edges on generalizations of Paley graphs." International Journal of Mathematics and Mathematical Sciences 27, no. 2 (2001): 111–23. http://dx.doi.org/10.1155/s0161171201002071.
Повний текст джерелаFÜRER, MARTIN, and SHIVA PRASAD KASIVISWANATHAN. "Approximately Counting Embeddings into Random Graphs." Combinatorics, Probability and Computing 23, no. 6 (July 9, 2014): 1028–56. http://dx.doi.org/10.1017/s0963548314000339.
Повний текст джерелаMcKay, Brendan D., and Stanisław P. Radziszowski. "Subgraph Counting Identities and Ramsey Numbers." Journal of Combinatorial Theory, Series B 69, no. 2 (March 1997): 193–209. http://dx.doi.org/10.1006/jctb.1996.1741.
Повний текст джерелаRoth, Marc. "Parameterized Counting of Partially Injective Homomorphisms." Algorithmica 83, no. 6 (March 11, 2021): 1829–60. http://dx.doi.org/10.1007/s00453-021-00805-y.
Повний текст джерелаBressan, Marco. "Faster algorithms for counting subgraphs in sparse graphs." Algorithmica 83, no. 8 (February 22, 2021): 2578–605. http://dx.doi.org/10.1007/s00453-021-00811-0.
Повний текст джерелаLiu, Xin, and Yangqiu Song. "Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 7 (June 28, 2022): 7594–602. http://dx.doi.org/10.1609/aaai.v36i7.20725.
Повний текст джерелаChe, Yulin, Zhuohang Lai, Shixuan Sun, Yue Wang, and Qiong Luo. "Accelerating truss decomposition on heterogeneous processors." Proceedings of the VLDB Endowment 13, no. 10 (June 2020): 1751–64. http://dx.doi.org/10.14778/3401960.3401971.
Повний текст джерелаWANLESS, IAN M. "Counting Matchings and Tree-Like Walks in Regular Graphs." Combinatorics, Probability and Computing 19, no. 3 (February 10, 2010): 463–80. http://dx.doi.org/10.1017/s0963548309990678.
Повний текст джерелаWang, Yuyi, Jan Ramon, and Thomas Fannes. "An efficiently computable subgraph pattern support measure: counting independent observations." Data Mining and Knowledge Discovery 27, no. 3 (May 9, 2013): 444–77. http://dx.doi.org/10.1007/s10618-013-0318-x.
Повний текст джерелаBrešar, Boštjan, Wilfried Imrich, and Sandi Klavžar. "Reconstructing subgraph-counting graph polynomials of increasing families of graphs." Discrete Mathematics 297, no. 1-3 (July 2005): 159–66. http://dx.doi.org/10.1016/j.disc.2005.02.019.
Повний текст джерелаGerbner, Dániel, and Cory Palmer. "Counting copies of a fixed subgraph in F-free graphs." European Journal of Combinatorics 82 (December 2019): 103001. http://dx.doi.org/10.1016/j.ejc.2019.103001.
Повний текст джерелаMeeks, Kitty. "The challenges of unbounded treewidth in parameterised subgraph counting problems." Discrete Applied Mathematics 198 (January 2016): 170–94. http://dx.doi.org/10.1016/j.dam.2015.06.019.
Повний текст джерела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.
Повний текст джерелаFocke, Jacob, Leslie Ann Goldberg, and Stanislav Živný. "The Complexity of Approximately Counting Retractions to Square-free Graphs." ACM Transactions on Algorithms 17, no. 3 (August 2021): 1–51. http://dx.doi.org/10.1145/3458040.
Повний текст джерелаJin, Wei, Fangyue Chen, and Qinbin He. "Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions." International Journal of Bifurcation and Chaos 31, no. 09 (July 2021): 2150138. http://dx.doi.org/10.1142/s0218127421501388.
Повний текст джерелаPrivault, Nicolas, and Grzegorz Serafin. "Normal approximation for sums of weighted $U$-statistics – application to Kolmogorov bounds in random subgraph counting." Bernoulli 26, no. 1 (February 2020): 587–615. http://dx.doi.org/10.3150/19-bej1141.
Повний текст джерелаTutaj, Edward. "Prime numbers with a certain extremal type property." Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica 17, no. 1 (December 1, 2018): 127–51. http://dx.doi.org/10.2478/aupcsm-2018-0010.
Повний текст джерелаSTARK, DUDLEY, and NICK WORMALD. "The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph." Combinatorics, Probability and Computing 27, no. 4 (May 9, 2018): 672–715. http://dx.doi.org/10.1017/s0963548318000202.
Повний текст джерела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.
Повний текст джерелаAmini, Omid, Fedor V. Fomin, and Saket Saurabh. "Counting Subgraphs via Homomorphisms." SIAM Journal on Discrete Mathematics 26, no. 2 (January 2012): 695–717. http://dx.doi.org/10.1137/100789403.
Повний текст джерелаWilliams, Virginia Vassilevska, and Ryan Williams. "Finding, Minimizing, and Counting Weighted Subgraphs." SIAM Journal on Computing 42, no. 3 (January 2013): 831–54. http://dx.doi.org/10.1137/09076619x.
Повний текст джерелаBorbényi, Márton, and Péter Csikvári. "Counting degree-constrained subgraphs and orientations." Discrete Mathematics 343, no. 6 (June 2020): 111842. http://dx.doi.org/10.1016/j.disc.2020.111842.
Повний текст джерелаCALEGARI, Danny, and Koji FUJIWARA. "Counting subgraphs in hyperbolic graphs with symmetry." Journal of the Mathematical Society of Japan 67, no. 3 (July 2015): 1213–26. http://dx.doi.org/10.2969/jmsj/06731213.
Повний текст джерелаKowaluk, Mirosław, Andrzej Lingas, and Eva-Marta Lundell. "Counting and Detecting Small Subgraphs via Equations." SIAM Journal on Discrete Mathematics 27, no. 2 (January 2013): 892–909. http://dx.doi.org/10.1137/110859798.
Повний текст джерелаKloks, Ton, Dieter Kratsch, and Haiko Müller. "Finding and counting small induced subgraphs efficiently." Information Processing Letters 74, no. 3-4 (May 2000): 115–21. http://dx.doi.org/10.1016/s0020-0190(00)00047-8.
Повний текст джерелаFomin, Fedor V., Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, and B. V. Raghavendra Rao. "Faster algorithms for finding and counting subgraphs." Journal of Computer and System Sciences 78, no. 3 (May 2012): 698–706. http://dx.doi.org/10.1016/j.jcss.2011.10.001.
Повний текст джерелаTahaei, Maedeh S., and Seyed Naser Hashemi. "Graph Characterization by Counting Sink Star Subgraphs." Journal of Mathematical Imaging and Vision 57, no. 3 (October 8, 2016): 439–54. http://dx.doi.org/10.1007/s10851-016-0686-0.
Повний текст джерелаOzsvárt, László. "Counting ordered graphs that avoid certain subgraphs." Discrete Mathematics 339, no. 7 (July 2016): 1871–77. http://dx.doi.org/10.1016/j.disc.2016.01.007.
Повний текст джерелаZhao, Zhao, Langshi Chen, Mihai Avram, Meng Li, Guanying Wang, Ali Butt, Maleq Khan, Madhav Marathe, Judy Qiu, and Anil Vullikanti. "Finding and Counting Tree-Like Subgraphs Using MapReduce." IEEE Transactions on Multi-Scale Computing Systems 4, no. 3 (July 1, 2018): 217–30. http://dx.doi.org/10.1109/tmscs.2017.2768426.
Повний текст джерелаRödl, Vojtĕch, and Jozef Skokan. "Counting subgraphs in quasi-random 4-uniform hypergraphs." Random Structures & Algorithms 26, no. 1-2 (January 2005): 160–203. http://dx.doi.org/10.1002/rsa.20056.
Повний текст джерелаGonen, Mira, Dana Ron, and Yuval Shavitt. "Counting Stars and Other Small Subgraphs in Sublinear-Time." SIAM Journal on Discrete Mathematics 25, no. 3 (January 2011): 1365–411. http://dx.doi.org/10.1137/100783066.
Повний текст джерелаEfthymiou, Charilaos. "Deterministic counting of graph colourings using sequences of subgraphs." Combinatorics, Probability and Computing 29, no. 4 (June 22, 2020): 555–86. http://dx.doi.org/10.1017/s0963548320000255.
Повний текст джерелаDörfler, Julian, Marc Roth, Johannes Schmitt, and Philip Wellnitz. "Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness." Algorithmica 84, no. 2 (December 7, 2021): 379–404. http://dx.doi.org/10.1007/s00453-021-00894-9.
Повний текст джерелаFARR, G. E. "The Complexity of Counting Colourings of Subgraphs of the Grid." Combinatorics, Probability and Computing 15, no. 03 (April 7, 2006): 377. http://dx.doi.org/10.1017/s0963548305007364.
Повний текст джерелаJerrum, Mark, and Kitty Meeks. "The parameterised complexity of counting even and odd induced subgraphs." Combinatorica 37, no. 5 (October 24, 2016): 965–90. http://dx.doi.org/10.1007/s00493-016-3338-5.
Повний текст джерелаBondy, J. A. "Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture." Discrete Mathematics 165-166 (March 1997): 71–80. http://dx.doi.org/10.1016/s0012-365x(96)00162-8.
Повний текст джерелаAliakbarpour, Maryam, Amartya Shankha Biswas, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, and Anak Yodpinyanee. "Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling." Algorithmica 80, no. 2 (February 10, 2017): 668–97. http://dx.doi.org/10.1007/s00453-017-0287-3.
Повний текст джерелаRoth, Marc, and Johannes Schmitt. "Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness." Algorithmica 82, no. 8 (January 22, 2020): 2267–91. http://dx.doi.org/10.1007/s00453-020-00676-9.
Повний текст джерелаJerrum, Mark, and Kitty Meeks. "The parameterised complexity of counting connected subgraphs and graph motifs." Journal of Computer and System Sciences 81, no. 4 (June 2015): 702–16. http://dx.doi.org/10.1016/j.jcss.2014.11.015.
Повний текст джерелаAlazemi, Abdullah, Milica Andjelic, and Slobodan Simic. "On the spectral invariants of symmetric matrices with applications in the spectral graph theory." Filomat 31, no. 10 (2017): 2925–32. http://dx.doi.org/10.2298/fil1710925a.
Повний текст джерелаGam, A. V. "Comparison the effectiveness two methods: of the spanning trees sampling method and method Rand-ESU." Journal of Physics: Conference Series 2182, no. 1 (March 1, 2022): 012019. http://dx.doi.org/10.1088/1742-6596/2182/1/012019.
Повний текст джерелаBjörklund, Andreas, Petteri Kaski, and Łukasz Kowalik. "Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time." ACM Transactions on Algorithms 13, no. 4 (December 21, 2017): 1–26. http://dx.doi.org/10.1145/3125500.
Повний текст джерелаFowler, Patrick W., Barry T. Pickup, and Tsanka Z. Todorova. "A graph-theoretical model for ballistic conduction in single-molecule conductors." Pure and Applied Chemistry 83, no. 8 (April 27, 2011): 1515–28. http://dx.doi.org/10.1351/pac-con-10-10-16.
Повний текст джерелаLiśkiewicz, Maciej, Mitsunori Ogihara, and Seinosuke Toda. "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes." Theoretical Computer Science 304, no. 1-3 (July 2003): 129–56. http://dx.doi.org/10.1016/s0304-3975(03)00080-x.
Повний текст джерелаBressan, Marco, Stefano Leucci, and Alessandro Panconesi. "Faster Motif Counting via Succinct Color Coding and Adaptive Sampling." ACM Transactions on Knowledge Discovery from Data 15, no. 6 (May 19, 2021): 1–27. http://dx.doi.org/10.1145/3447397.
Повний текст джерелаKaroński, Michał, and Andrzej Ruciński. "Poisson convergence and semi-induced properties of random graphs." Mathematical Proceedings of the Cambridge Philosophical Society 101, no. 2 (March 1987): 291–300. http://dx.doi.org/10.1017/s0305004100066664.
Повний текст джерелаMokhlissi, Raihana, Dounia Lotfi, Joyati Debnath, Mohamed El Marraki, and Noussaima EL Khattabi. "The Evaluation of the Number and the Entropy of Spanning Trees on Generalized Small-World Networks." Journal of Applied Mathematics 2018 (September 3, 2018): 1–7. http://dx.doi.org/10.1155/2018/1017308.
Повний текст джерелаKarimov, E. M. "THE ROLE OF INTRAZONAL FEATURES IN CLARIFYING THE ROAD AND CLIMATIC ZONING OF THE TERRITORY OF SOUTHWESTERN KYRGYZSTAN." Herald of KSUCTA n a N Isanov, no. 2-2-2022 (April 30, 2022): 574–82. http://dx.doi.org/10.35803/1694-5298.2022.2.574-582.
Повний текст джерела