Výsledky vyhledávání - Graph Theory – Graph Algorithms. General Terms Algorithms

Upřesnit hledání
  1. 1

    Graph theoretic methods in multiagent networks Autor Mesbahi, Mehran, Egerstedt, Magnus

    ISBN: 1400835356, 9781400835355, 9780691140612, 0691140618
    Vydáno: Princeton Princeton University Press 2010
    “… The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol…”
    Získat plný text
    E-kniha Kniha
  2. 2

    Quantum approximate optimization of non-planar graph problems on a planar superconducting processor Autor Harrigan, Matthew P, Sung, Kevin J, Neeley, Matthew, Satzinger, Kevin J, Arute Frank, Arya Kunal, Atalaya Juan, Bardin, Joseph C, Barends Rami, Boixo Sergio, Broughton, Michael, Buckley, Bob B, Buell, David A, Burkett, Brian, Bushnell, Nicholas, Chen, Yu, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Courtney, William, Demura, Sean, Dunsworth, Andrew, Eppens, Daniel, Fowler, Austin, Brooks, Foxen, Gidney, Craig, Giustina Marissa, Graff, Rob, Habegger, Steve, Ho, Alan, Hong, Sabrina, Huang, Trent, Ioffe, L B, Isakov, Sergei V, Evan, Jeffrey, Zhang, Jiang, Jones, Cody, Kafri Dvir, Kechedzhi Kostyantyn, Kelly, Julian, Kim, Seon, Klimov, Paul V, Korotkov, Alexander N, Kostritsa Fedor, Landhuis, David, Laptev Pavel, Lindmark, Mike, Leib, Martin, Martin, Orion, Martinis, John M, McClean, Jarrod R, McEwen, Matt, Megrant Anthony, Xiao, Mi, Mohseni Masoud, Mruczkiewicz Wojciech, Mutus Josh, Naaman Ofer, Neill, Charles, Neukart Florian, Niu Murphy Yuezhen, O’Brien Thomas E, O’Gorman Bryan, Ostby, Eric, Petukhov, Andre, Putterman Harald, Quintana, Chris, Roushan Pedram, Rubin, Nicholas C, Sank, Daniel, Skolik Andrea, Smelyanskiy Vadim, Strain, Doug, Streif, Michael, Szalay, Marco, Vainsencher Amit, White, Theodore, Jamie, Yao Z, Yeh Ping, Zalcman, Adam, Zhou, Leo, Neven Hartmut, Bacon, Dave, Lucero, Erik, Farhi, Edward, Ryan, Babbush

    ISSN: 1745-2473, 1745-2481
    Vydáno: London Nature Publishing Group 01.03.2021
    Vydáno v Nature physics (01.03.2021)
    “…Faster algorithms for combinatorial optimization could prove transformative for diverse areas such as logistics, finance and machine learning…”
    Získat plný text
    Journal Article
  3. 3

    Point Cloud Denoising via Feature Graph Laplacian Regularization Autor Dinesh, Chinthaka, Cheung, Gene, Bajic, Ivan V.

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Vydáno: United States IEEE 01.01.2020
    Vydáno v IEEE transactions on image processing (01.01.2020)
    “… Building on recent advances in graph signal processing, we design local algorithms for 3D point cloud denoising…”
    Získat plný text
    Journal Article
  4. 4

    Weighted Graph Cuts without Eigenvectors A Multilevel Approach Autor Dhillon, I.S., Yuqiang Guan, Kulis, B.

    ISSN: 0162-8828, 1939-3539
    Vydáno: Los Alamitos, CA IEEE 01.11.2007
    “… equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast high-quality multilevel algorithm that directly optimizes various…”
    Získat plný text
    Journal Article
  5. 5

    Unsupervised Feature Selection With Constrained ℓ₂,₀-Norm and Optimized Graph Autor Nie, Feiping, Dong, Xia, Tian, Lai, Wang, Rong, Li, Xuelong

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Vydáno: United States IEEE 01.04.2022
    “… (row-sparsity constrained) and optimized graph (RSOGFS), which unifies feature selection and similarity matrix construction into a general framework instead of independently performing the two-stage process…”
    Získat plný text
    Journal Article
  6. 6

    Learning Graph Matching Autor Caetano, T.S., McAuley, J.J., Li Cheng, Le, Q.V., Smola, A.J.

    ISSN: 0162-8828, 1939-3539
    Vydáno: Los Alamitos, CA IEEE 01.06.2009
    “… Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility…”
    Získat plný text
    Journal Article
  7. 7

    Drawing graphs with k vertices per face: Complexity and algorithms Autor Bekos, Michael A., Di Battista, Giuseppe, Di Giacomo, Emilio, Didimo, Walter, Kaufmann, Michael, Montecchiani, Fabrizio

    ISSN: 0304-3975
    Vydáno: Elsevier B.V 22.12.2025
    Vydáno v Theoretical computer science (22.12.2025)
    “… Graphs that admit a k+-real face drawing are k+-real face graphs; they have been studied so far in terms of edge density and inclusion relationships…”
    Získat plný text
    Journal Article
  8. 8

    Design and modeling of graph theory approach based routing algorithm Autor Sivasankar, S., Devasenapathy, Deepa, Madhumathy, P, Kaur, Gursimran, Sharma, Yogita, Rana, Prince

    ISSN: 1955-2513, 1955-2505
    Vydáno: Paris Springer Paris 01.10.2024
    “… A theoretical example uses graph theory, a method with associated requirements for data organization to make use of the benefits of this notion offers…”
    Získat plný text
    Journal Article
  9. 9

    Efficient Graph Algorithms in Securing Communication Networks Autor Bokhary, Syed, Kharal, Athar, Samman, Fathia, Dalam, Mhassen, Gargouri, Ameni

    ISSN: 2073-8994, 2073-8994
    Vydáno: Basel MDPI AG 01.10.2024
    Vydáno v Symmetry (Basel) (01.10.2024)
    “…This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks…”
    Získat plný text
    Journal Article
  10. 10

    An exact algorithm for disaster-resilience augmentation of planar straight-line graphs: An exact algorithm for disaster-resilience augmentation Autor Westcott, Alexander, Ras, Charl

    ISSN: 0925-5001, 1573-2916
    Vydáno: New York Springer US 01.06.2025
    Vydáno v Journal of global optimization (01.06.2025)
    “… in terms of the convex hull of the given graph, and present a fast ILP algorithm for generating optimal solutions…”
    Získat plný text
    Journal Article
  11. 11

    Granular reduction in formal fuzzy contexts: graph representation, graph approach and its algorithm Autor Gong, Zengtai, Zhang, Jing

    ISSN: 0269-2821, 1573-7462
    Vydáno: Dordrecht Springer Netherlands 01.12.2023
    Vydáno v The Artificial intelligence review (01.12.2023)
    “… The manuscript also sets forth algorithms for finding minimal granular reducts based on graph theory…”
    Získat plný text
    Journal Article
  12. 12

    Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition Autor Lu, Keng-Shih, Ortega, Antonio

    ISSN: 1053-587X, 1941-0476
    Vydáno: New York IEEE 15.09.2019
    “…The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering…”
    Získat plný text
    Journal Article
  13. 13

    Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis Autor Fan, Zhou, Mao, Cheng, Wu, Yihong, Xu, Jiaming

    ISSN: 1615-3375, 1615-3383
    Vydáno: New York Springer US 01.10.2023
    “…Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation…”
    Získat plný text
    Journal Article
  14. 14

    Six methods for transforming layered hypergraphs to apply layered graph layout algorithms Autor Di Bartolomeo, Sara, Pister, Alexis, Buono, Paolo, Plaisant, Catherine, Dunne, Cody, Fekete, Jean‐Daniel

    ISSN: 0167-7055, 1467-8659
    Vydáno: Oxford Blackwell Publishing Ltd 01.06.2022
    Vydáno v Computer graphics forum (01.06.2022)
    “… visualize them. To optimize a hypergraph drawing for readability, we need a layout algorithm. Common graph layout algorithms only consider ordinary graphs and do not take hyperedges into account…”
    Získat plný text
    Journal Article
  15. 15

    Graph drawing using Jaya Autor Dib, Fadi K., Rodgers, Peter

    ISSN: 1932-6203, 1932-6203
    Vydáno: United States Public Library of Science 27.06.2023
    Vydáno v PloS one (27.06.2023)
    “…, an area where current search-based methods seek improvement. In this paper, we investigate the performance of Jaya algorithm for automatic graph layout with straight lines…”
    Získat plný text
    Journal Article
  16. 16

    Equivariant quantum circuits for learning on weighted graphs Autor Skolik, Andrea, Cattelan, Michele, Yarkoni, Sheir, Bäck, Thomas, Dunjko, Vedran

    ISSN: 2056-6387, 2056-6387
    Vydáno: London Nature Publishing Group UK 13.05.2023
    Vydáno v npj quantum information (13.05.2023)
    “…Variational quantum algorithms are the leading candidate for advantage on near-term quantum hardware…”
    Získat plný text
    Journal Article
  17. 17

    Message-Passing Algorithms for Counting Short Cycles in a Graph Autor Karimi, M., Banihashemi, A. H.

    ISSN: 0090-6778
    Vydáno: New York, NY IEEE 01.02.2013
    Vydáno v IEEE transactions on communications (01.02.2013)
    “… For sparse graphs, the proposed algorithm significantly outperforms the existing algorithms, tailored for counting em short cycles, in terms of computational…”
    Získat plný text
    Journal Article
  18. 18

    Learning on knowledge graph dynamics provides an early warning of impactful research Autor Weis, James W., Jacobson, Joseph M.

    ISSN: 1087-0156, 1546-1696, 1546-1696
    Vydáno: New York Nature Publishing Group US 01.10.2021
    Vydáno v Nature biotechnology (01.10.2021)
    “… We prototype this framework and deduce its performance and scaling properties on time-structured publication graphs from 1980 to 2019 drawn from 42 biotechnology-related journals, including…”
    Získat plný text
    Journal Article
  19. 19

    Modified graph-based algorithm to analyze security threats in IoT Autor Arat, Ferhat, Akleylek, Sedat

    ISSN: 2376-5992, 2376-5992
    Vydáno: United States PeerJ. Ltd 08.12.2023
    Vydáno v PeerJ. Computer science (08.12.2023)
    “…) is a subset of IoT in terms of applications and usage areas. IIoT presents many participants in various domains, such as healthcare, transportation, agriculture, and manufacturing…”
    Získat plný text
    Journal Article
  20. 20

    Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm Autor Remacle, J.-F., Lambrechts, J., Seny, B., Marchandise, E., Johnen, A.,  Geuzainet, C.

    ISSN: 0029-5981, 1097-0207, 1097-0207
    Vydáno: Chichester, UK John Wiley & Sons, Ltd 02.03.2012
    “…‐known algorithm of the graph theory, namely the Blossom algorithm, that computes the minimum…”
    Získat plný text
    Journal Article