„Graph computing“

Suchergebnisse

2.363 Treffer

• Computing vertex-disjoint paths in large graphs using MAOs
  Preißer, Johanna E. ; Schmidt, Jens M. 2018 TU Ilmenau
• Designing Parallel Graph Coloring Algorithm - A Research Perspective – Design and Analysis of Algorithms
  Patidar, Harish ; Chakrabarti, Prasun 2020 LAP LAMBERT Academic Publishing
• Fog and Cloud Revolution – Service Provisioning for the Internet of Things Applications in multi-tier Fog Computing Architecture
  Altowayti, Mohammed ; Maiti, Prasenjit ; Sahoo, Bibhudatta 2020 LAP LAMBERT Academic Publishing
• Strip Planarity Testing for Embedded Planar Graphs
  Angelini, Patrizio ; Da Lozzo, Giordano ; Di Battista, Giuseppe ; Frati, Fabrizio
• Multivariate Analysis of Orthogonal Range Searching and Graph Distances
  Bringmann, Karl ; Husfeldt, Thore ; Magnusson, Måns
• Combining Graph Exploration and Fragmentation for Scalable RDF Query Processing
  Khelil, Abdallah ; Mesmoudi, Amin ; Galicia, Jorge ; Bellatreche, Ladjel ; Hacid, Mohand-Saïd ; Coquery, Emmanuel
• Non-commutative graphs and quantum error correction for a two-mode quantum oscillator
  Amosov, G. G. ; Mokeev, A. S. ; Pechen, A. N.
• Quantum channels over graph states using generalized measurement-based quantum computation framework
  Raina, Ankur ; Garani, Shayan Srinivasa
• Maximal entanglement and switch squeezing with atom coupled to cavity field and graphene membrane
  Liao, Qinghong ; He, Gaoqian
• Flooding region growing: a new parallel image segmentation model based on membrane computing
  Dalvand, Mehran ; Fathi, Abdolhossein ; Kamran, Arezoo
• Special issue on multimedia fog/edge computing systems
  Jin, Yong ; D’Agostino, Daniele ; Achir, Nadjib ; Nightingale, James ; Wang, Jiacun
• Strongly regular graphs arising from non-weakly regular bent functions
  Özbudak, Ferruh ; Pelen, Rumİ Melİh
• Recovery of quantum information from a node failure in a graph
  Raina, Ankur ; Nadkarni, Priya J. ; Garani, Shayan Srinivasa
• A link-elimination partitioning approach for application graph mapping in reconfigurable computing systems
  Mohtavipour, Seyed Mehdi ; Shahhoseini, Hadi Shahriar
• Crossing Number for Graphs with Bounded Pathwidth
  Biedl, Therese ; Chimani, Markus ; Derka, Martin ; Mutzel, Petra
• On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
  Barbero, Florian ; Isenmann, Lucas ; Thiebaut, Jocelyn
• Szegedy quantum walks with memory on regular graphs
  Li, Dan ; Liu, Ying ; Yang, Yu-Guang ; Xu, Juan ; Yuan, Jia-Bin
• An $${\mathcal {O}}(n^2 \log {n})$$ O ( n 2 log n ) algorithm for the weighted stable set problem in claw-free graphs
  Nobili, Paolo ; Sassano, Antonio
• Computing and graphing probability values of pearson distributions: a SAS/IML macro
  Yang, Qing ; An, Xinming ; Pan, Wei
• An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
  Bergougnoux, Benjamin ; Kanté, Mamadou Moustapha ; Kwon, O-joung