Literatura científica selecionada sobre o tema "K-graph system"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "K-graph system".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "K-graph system"
Il’ev, A. V., e V. P. Il’ev. "ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS". Prikladnaya Diskretnaya Matematika, n.º 53 (2021): 89–102. http://dx.doi.org/10.17223/20710410/53/6.
Texto completo da fonteAsif, Muhammad, Hamad Almohamedh, Muhammad Hussain, Khalid M. Alhamed, Abdulrazaq A. Almutairi e Sultan Almotairi. "An Approach to the Geometric-Arithmetic Index for Graphs under Transformations’ Fact over Pendent Paths". Complexity 2021 (24 de junho de 2021): 1–13. http://dx.doi.org/10.1155/2021/3745862.
Texto completo da fonteUstimenko, Vasyl O., e Oleksandr S. Pustovit. "On security of GIS systems with N-tier architecture and family of graph based ciphers". Environmental safety and natural resources 47, n.º 3 (29 de setembro de 2023): 113–32. http://dx.doi.org/10.32347/2411-4049.2023.3.113-132.
Texto completo da fonteRANAWAKE, U. A., P. M. LENDERS e S. M. GOODNICK. "ON LOWER BOUNDS FOR THE COMMUNICATION VOLUME IN DISTRIBUTED SYSTEMS". Parallel Processing Letters 01, n.º 02 (dezembro de 1991): 125–33. http://dx.doi.org/10.1142/s0129626491000070.
Texto completo da fonteLobov, Alexander A., e Mikhail B. Abrosimov. "About uniqueness of the minimal 1-edge extension of hypercube Q4". Prikladnaya Diskretnaya Matematika, n.º 58 (2023): 84–93. http://dx.doi.org/10.17223/20710410/58/8.
Texto completo da fonteChen, Haiyan, e Fuji Zhang. "Spectral Dynamics of Graph Sequences Generated by Subdivision and Triangle Extension". Electronic Journal of Linear Algebra 32 (6 de fevereiro de 2017): 454–63. http://dx.doi.org/10.13001/1081-3810.3583.
Texto completo da fonteRazumovsky, P. V., e M. B. Abrosimov. "THE MINIMAL VERTEX EXTENSIONS FOR COLORED COMPLETE GRAPHS". Bulletin of the South Ural State University series "Mathematics. Mechanics. Physics" 13, n.º 4 (2021): 77–89. http://dx.doi.org/10.14529/mmph210409.
Texto completo da fonteAslam, Adnan, Safyan Ahmad, Muhammad Ahsan Binyamin e Wei Gao. "Calculating topological indices of certain OTIS interconnection networks". Open Chemistry 17, n.º 1 (10 de abril de 2019): 220–28. http://dx.doi.org/10.1515/chem-2019-0029.
Texto completo da fonteShirdel, G. H., M. Ghanbari e M. Ramezani. "Generalized 3-Rainbow Domination in Graphs and Honeycomb System (HC(n))". Utilitas Mathematica 119, n.º 1 (31 de março de 2024): 3–7. http://dx.doi.org/10.61091/um119-01.
Texto completo da fontePavlopoulou, Niki. "Dynamic Diverse Summarisation in Heterogeneous Graph Streams: a Comparison between Thesaurus/Ontology-based and Embeddings-based Approaches". International Journal of Graph Computing 1, n.º 1 (1 de março de 2020): 70–94. http://dx.doi.org/10.35708/gc1868-126724.
Texto completo da fonteTeses / dissertações sobre o assunto "K-graph system"
Wang, Bin. "Rainbow structures in properly edge-colored graphs and hypergraph systems". Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG016.
Texto completo da fonteExtremal Combinatorics is one of the most vigorous branch of Combinatorial Mathematics in recent decades and it has been widely used in Computer Science, Network Design and Coding Design. It focuses on determining the maximum or minimum possible size of certain combinatorial structures, subject to certain conditions or constraints. The host sets could be graphs, digraphs, random graphs, hypergraphs, integers, primes, sets, edge-colored graphs and so on. The local structures could be matchings, cliques, cycles, trees, spanning subgraphs (F-factors, Hamilton cycles), intersecting families, arithmetic progressions, solutions for some equations (e.g. x₊y₌z), rainbow subgraphs and so on. In particular, Extremal Graph Theory is a significant branch of Extremal Combinatorics, which primarily explores how the overall properties of a graph influence its local structures. We study the existence of a rainbow Hamilton cycle in k-graph systems, the existence of rainbow perfect matching in k-graph systems, and the existence of long rainbow cycle in properly edge-colored graphs
Dyck, Johannes [Verfasser], Holger [Akademischer Betreuer] Giese, Holger [Gutachter] Giese, Arend [Gutachter] Rensink e Heike [Gutachter] Wehrheim. "Verification of graph transformation systems with k-inductive invariants / Johannes Dyck ; Gutachter: Holger Giese, Arend Rensink, Heike Wehrheim ; Betreuer: Holger Giese". Potsdam : Universität Potsdam, 2020. http://d-nb.info/121816980X/34.
Texto completo da fonteLi, Xiaohu. "Security Analysis on Network Systems Based on Some Stochastic Models". ScholarWorks@UNO, 2014. http://scholarworks.uno.edu/td/1931.
Texto completo da fonteSwailes, David. "Some topics in industrial mathematics arising from a multi-national company : gel electrophoresis graph matching algorithm; modelling H'+ and K'+ transport across cell membranes; and micellization and adsorption processes in micellar systems". Thesis, University of Strathclyde, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339870.
Texto completo da fonteDavison, Benjamin Kenneth. "Universal graph literacy: understanding how blind and low vision students can satisfy the common core standards with accessible auditory graphs". Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47621.
Texto completo da fonteМорозов, Костянтин В’ячеславович. "Методи і засоби побудови моделей поведінки небазових відмовостійких багатопроцесорних систем". Doctoral thesis, Київ, 2021. https://ela.kpi.ua/handle/123456789/40485.
Texto completo da fonteBodin, Bruno. "Analyse d'Applications Flot de Données pour la Compilation Multiprocesseur". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00922578.
Texto completo da fonteCapítulos de livros sobre o assunto "K-graph system"
Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck e Sadegh Soudjani. "A Direct Symbolic Algorithm for Solving Stochastic Rabin Games". In Tools and Algorithms for the Construction and Analysis of Systems, 81–98. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_5.
Texto completo da fonteSun, Wei, Laisheng Xiang, Xiyu Liu e Dan Zhao. "An Improved K-medoids Clustering Algorithm Based on a Grid Cell Graph Realized by the P System". In Human Centered Computing, 365–74. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31854-7_33.
Texto completo da fonteMorais, Bruno, Miguel E. Coimbra e Luís Veiga. "PK-Graph: Partitioned $$k^2$$-Trees to Enable Compact and Dynamic Graphs in Spark GraphX". In Cooperative Information Systems, 149–67. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-17834-4_9.
Texto completo da fonteLarsen, Casper Abild, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol e Andreas Pavlogiannis. "A Truly Symbolic Linear-Time Algorithm for SCC Decomposition". In Tools and Algorithms for the Construction and Analysis of Systems, 353–71. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30820-8_22.
Texto completo da fonteZou, Lei, Lei Chen e Yansheng Lu. "Top-K Correlation Sub-graph Search in Graph Databases". In Database Systems for Advanced Applications, 168–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00887-0_14.
Texto completo da fonteStokes, Klara. "Graph k-Anonymity through k-Means and as Modular Decomposition". In Secure IT Systems, 263–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41488-6_18.
Texto completo da fonteSubercaseaux, Bernardo, e Marijn J. H. Heule. "The Packing Chromatic Number of the Infinite Square Grid is 15". In Tools and Algorithms for the Construction and Analysis of Systems, 389–406. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_20.
Texto completo da fonteNayak, Satya Prakash, e Anne-Kathrin Schmuck. "Most General Winning Secure Equilibria Synthesis in Graph Games". In Tools and Algorithms for the Construction and Analysis of Systems, 173–93. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57256-2_9.
Texto completo da fonteHausmann, Daniel, e Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints". In Tools and Algorithms for the Construction and Analysis of Systems, 38–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.
Texto completo da fonteVasilyeva, Elena, Maik Thiele, Christof Bornhövd e Wolfgang Lehner. "Top-k Differential Queries in Graph Databases". In Advances in Databases and Information Systems, 112–25. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10933-6_9.
Texto completo da fonteTrabalhos de conferências sobre o assunto "K-graph system"
Kocan, F. "Reconfigurable randomized K-way graph partitioning". In Proceedings. Euromicro Symposium on Digital System Design. IEEE, 2003. http://dx.doi.org/10.1109/dsd.2003.1231947.
Texto completo da fonteChen, Penghe, Yu Lu, Vincent W. Zheng, Xiyang Chen e Xiaoqing Li. "An automatic knowledge graph construction system for K-12 education". In L@S '18: Fifth (2018) ACM Conference on Learning @ Scale. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3231644.3231698.
Texto completo da fonteWang, Yan, Amar Henni, Azade Fotouhi e Leopold Mvondo Ze. "Leveraging K-hop based Graph for the Staffing Recommender System with Parametric Geolocation". In 2022 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2022. http://dx.doi.org/10.1109/csci58124.2022.00122.
Texto completo da fonteAsgari, Zahra, e Maryam Sadat Mastoori. "Binomial Distribution based K-means for Graph Partitioning Approach in Partially Reconfigurable Computing system". In 2021 29th Iranian Conference on Electrical Engineering (ICEE). IEEE, 2021. http://dx.doi.org/10.1109/icee52715.2021.9544358.
Texto completo da fonteAsgari, Zahra, e Maryam Sadat Mastoori. "Binomial Distribution based K-means for Graph Partitioning Approach in Partially Reconfigurable Computing system". In 2021 29th Iranian Conference on Electrical Engineering (ICEE). IEEE, 2021. http://dx.doi.org/10.1109/icee52715.2021.9544358.
Texto completo da fonteRiveret, Regis, Son Tran e Artur d'Avila Garcez. "Neuro-Symbolic Probabilistic Argumentation Machines". In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/90.
Texto completo da fonteStańczak, Jarosław, Jan Owsiński, Barbara Mażbic-Kulma, Aleksy Barski e Krzysztof Sęp. "Evolutionary k-means Graph Clustering Method to Obtain the hub&spoke Structure for Warsaw Communication System". In 18th Conference on Computer Science and Intelligence Systems. PTI, 2023. http://dx.doi.org/10.15439/2023f9176.
Texto completo da fonteYou, Li. "Multi-party quantum correlation and entanglement". In Workshop on Entanglement and Quantum Decoherence. Washington, D.C.: Optica Publishing Group, 2008. http://dx.doi.org/10.1364/weqd.2008.eas2.
Texto completo da fonteSeong, Bo-Ok, Jimin Ahn, Myeongjun Son e Hyeongok Lee. "Three-degree graph and design of an optimal routing algorithm". In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001466.
Texto completo da fonteZhao, Yue, Francesco Di Maio, Enrico Zio, Qin Zhang e Chunling Dong. "Genetic Algorithm Optimization of a Dynamic Uncertain Causality Graph (DUCG) for Fault Diagnosis in Nuclear Power Plants". In 2016 24th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/icone24-60199.
Texto completo da fonte