„Graph computing“

Suchergebnisse

2.363 Treffer

• Search on vertex-transitive graphs by lackadaisical quantum walk
  Rhodes, Mason L. ; Wong, Thomas G.
• Quantum walk inspired algorithm for graph similarity and isomorphism
  Schofield, Callum ; Wang, Jingbo ; Li, Yuying
• BFPF-Cloud: Applying SVM for Byzantine Failure Prediction to Increase Availability and Failure Tolerance in Cloud Computing
  Beheshti, Mahnaz Koorang ; Safi-Esfahani, Faramarz
• Hybrid IT and Multi Cloud an Emerging Trend and Improved Performance in Cloud Computing
  Gundu, Srinivasa Rao ; Panem, Charan Arur ; Thimmapuram, Anuradha
• A Survey on Cloud Computing Simulation and Modeling
  Bambrik, Ilyas
• On the Complexity of Colouring Antiprismatic Graphs
  Preissmann, Myriam ; Robin, Cléophée ; Trotignon, Nicolas
• Constrained Minimum Passage Time in Random Geometric Graphs
  Ganesan, Ghurumuruhan
• Convex graph invariant relaxations for graph edit distance
  Candogan, Utkan Onur ; Chandrasekaran, Venkat
• Distance and Routing Labeling Schemes for Cube-Free Median Graphs
  Chepoi, Victor ; Labourel, Arnaud ; Ratel, Sébastien
• Double vertex-edge domination in graphs: complexity and algorithms
  Naresh Kumar, H. ; Pradhan, D. ; Venkatakrishnan, Y. B.
• Factor graph fragmentization of expectation propagation
  Chen, Wilson Y. ; Wand, Matt P.
• Guest Editorial Note: Special Issue on Applied Reconfigurable Computing
  Keramidas, Georgios ; Voros, Nikolaos ; Huebner, Michael ; Goehringer, Diana
• Identification of most influential co-occurring gene suites for gastrointestinal cancer using biomedical literature mining and graph-based influence maximization
  Wang, Charles C. N. ; Jin, Jennifer ; Chang, Jan-Gowth ; Hayakawa, Masahiro ; Kitazawa, Atsushi ; Tsai, Jeffrey J. P. ; Sheu, Phillip C.-Y
• Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs
  Zhang, An ; Chen, Yong ; Chen, Zhi-Zhong ; Lin, Guohui
• KGHC: a knowledge graph for hepatocellular carcinoma
  Li, Nan ; Yang, Zhihao ; Luo, Ling ; Wang, Lei ; Zhang, Yin ; Lin, Hongfei ; Wang, Jian
• Tight Bounds for Online Coloring of Basic Graph Classes
  Albers, Susanne ; Schraink, Sebastian
• Computing the trajectories for the development of optimal routes
  Zazai, M. Fawad ; Fügenschuh, Armin 2019 Brandenburgische Technische Universität Cottbus-Senftenberg, Fakultät 1, MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik, Institut für Mathematik
• Understanding the complexities of Bluetooth for representing real-life social networks – A methodology for inferring and validating Bluetooth-based social network graphs
  Simoski, Bojan ; Klein, Michel C.A ; Araújo, Eric Fernandes de Mello ; Halteren, Aart T. van ; Woudenberg, Thabo J. van ; Bevelander, Kirsten E. ; Buijzen, Moniek ; Bal, Henri
• Borodin–Kostochka’s conjecture on $$(P_5,C_4)$$ ( P 5 , C 4 ) -free graphs
  Gupta, Uttam K. ; Pradhan, D.
• Parameterized Complexity of Independent Set in H-Free Graphs
  Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre ; Thomassé, Stéphan ; Watrigant, Rémi