„Graph computing“

Suchergebnisse

2.363 Treffer

• Quantum and Blockchain-based Next Generation Sustainable Computing
  Pulipeti, Srikanth ; Kumar, Adarsh ; Mysore, Nagaraju ; Peoples, Cathryn 2024 Springer Nature Switzerland, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part VI
  Huang, De-Shuang ; Si, Zhanjun ; Chen, Wei 2024 Springer Nature Singapore, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part V
  Huang, De-Shuang ; Zhang, Xiankun ; Zhang, Chuanlei 2024 Springer Nature Singapore, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part III
  Huang, De-Shuang ; Si, Zhanjun ; Zhang, Qinhu 2024 Springer Nature Singapore, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part I
  Huang, De-Shuang ; Zhang, Xiankun ; Zhang, Qinhu 2024 Springer Nature Singapore, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part II
  Huang, De-Shuang ; Zhang, Chuanlei ; Pan, Yijie 2024 Springer Nature Singapore, Imprint: Springer
• Advanced Intelligent Computing Technology and Applications – 20th International Conference, ICIC 2024, Tianjin, China, August 5–8, 2024, Proceedings, Part IV
  Huang, De-Shuang ; Si, Zhanjun ; Zhang, Chuanlei 2024 Springer Nature Singapore, Imprint: Springer
• Shortest noncrossing paths in plane graphs
  Takahashi, Junya ; Suzuki, Hitoshi ; Nishizeki, Takao
• Decremental 2- and 3-connectivity on planar graphs
  Giammarresi, D. ; Italiano, G. F.
• An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
  Sunder, S. ; He, Xin
• A paradigm for listing (s, t)-cuts in graphs
  Provan, J. S. ; Shier, D. R.
• A program for computing identity-kernels from certain directed graphs
  Abramson, H. D.
• Algorithms for computing the center of area of a convex polygon
  Díaz, Matthew ; O'Rourke, Joseph
• An algorithm for computing all paths in a graph
  Thorelli, Lars-Erik
• Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph
  Easwarakumar, K. S. ; Krishnan, S. V. ; Rangan, C. Pandu ; Seshadri, S.
• On the number of Eulerian orientations of a graph
  Mihail, M. ; Winkler, P.
• Algorithms for dense graphs and networks on the random access computer
  Cheriyan, J. ; Mehlhorn, K.
• Fast algorithms for minimum matrix norm with application in computer graphics
  Tang, Shouwen ; Zhang, Kaizhong ; Wu, Xiaolin
• Visual computing report
  2023 Fraunhofer-Institut für Graphische Datenverarbeitung IGD
• Chromatic polynomial of a picture fuzzy graph with application in traffic light control
  Abbas, Qamar ; Mustafa, Ghulam