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

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

“… The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol…”
Získat plný text

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

“…Faster algorithms for combinatorial optimization could prove transformative for diverse areas such as logistics, finance and machine learning…”
Získat plný text

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

“… Building on recent advances in graph signal processing, we design local algorithms for 3D point cloud denoising…”
Získat plný text

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

“… 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

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

“… (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

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

“… 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

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

“… 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

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

“… 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

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

“…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

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

“… in terms of the convex hull of the given graph, and present a fast ILP algorithm for generating optimal solutions…”
Získat plný text

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

“… The manuscript also sets forth algorithms for finding minimal granular reducts based on graph theory…”
Získat plný text

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

“…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

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

“…Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation…”
Získat plný text

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

“… 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

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

“…, 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

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

“… 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

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

“… 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

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

“…) 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

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.

“…‐known algorithm of the graph theory, namely the Blossom algorithm, that computes the minimum…”
Získat plný text

Trade-Offs in Dynamic Coloring for Bipartite and General Graphs Autor Kashyop, Manas Jyoti, Narayanaswamy, N. S., Nasre, Meghana, Potluri, Sai Mohith

“…The dynamic coloring problem has gained attention in the recent past. The focus has largely been on obtaining efficient update time algorithms using Δ…”
Získat plný text