咨询与建议

限定检索结果

文献类型

  • 2,067 篇 期刊文献
  • 820 篇 会议
  • 41 篇 学位论文
  • 7 册 图书
  • 1 篇 资讯

馆藏范围

  • 2,935 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 2,319 篇 工学
    • 2,077 篇 计算机科学与技术...
    • 518 篇 软件工程
    • 349 篇 电气工程
    • 131 篇 测绘科学与技术
    • 130 篇 建筑学
    • 130 篇 土木工程
    • 129 篇 信息与通信工程
    • 77 篇 控制科学与工程
    • 34 篇 电子科学与技术(可...
    • 22 篇 网络空间安全
    • 20 篇 生物工程
    • 18 篇 材料科学与工程(可...
    • 13 篇 仪器科学与技术
    • 12 篇 交通运输工程
    • 11 篇 化学工程与技术
    • 11 篇 安全科学与工程
    • 10 篇 石油与天然气工程
  • 1,053 篇 理学
    • 944 篇 数学
    • 80 篇 统计学(可授理学、...
    • 62 篇 生物学
    • 51 篇 物理学
    • 27 篇 化学
    • 20 篇 系统科学
  • 190 篇 管理学
    • 140 篇 管理科学与工程(可...
    • 62 篇 图书情报与档案管...
    • 38 篇 工商管理
  • 36 篇 经济学
    • 35 篇 应用经济学
  • 33 篇 医学
    • 16 篇 临床医学
    • 11 篇 基础医学(可授医学...
  • 19 篇 法学
    • 14 篇 社会学
  • 9 篇 教育学
  • 8 篇 文学
  • 6 篇 农学
  • 1 篇 艺术学

主题

  • 2,936 篇 graph algorithms
  • 140 篇 approximation al...
  • 106 篇 algorithms
  • 94 篇 parallel algorit...
  • 65 篇 computational co...
  • 64 篇 graph theory
  • 56 篇 parameterized co...
  • 52 篇 combinatorial pr...
  • 49 篇 analysis of algo...
  • 45 篇 shortest paths
  • 45 篇 planar graphs
  • 44 篇 treewidth
  • 39 篇 social networks
  • 36 篇 data structures
  • 36 篇 distributed comp...
  • 33 篇 distributed algo...
  • 29 篇 parameterized al...
  • 29 篇 complexity
  • 29 篇 np-completeness
  • 26 篇 interval graphs

机构

  • 24 篇 univ bergen dept...
  • 19 篇 univ elect sci &...
  • 16 篇 ben gurion univ ...
  • 15 篇 ben gurion univ ...
  • 12 篇 carnegie mellon ...
  • 12 篇 stanford univ de...
  • 10 篇 ist austria klos...
  • 10 篇 carleton univ sc...
  • 9 篇 univ vienna fac ...
  • 9 篇 technion israel ...
  • 9 篇 brno university ...
  • 9 篇 carnegie mellon ...
  • 9 篇 univ rostock ins...
  • 8 篇 indian inst tech...
  • 8 篇 simon fraser uni...
  • 8 篇 chinese univ hon...
  • 8 篇 swiss fed inst t...
  • 8 篇 carnegie mellon ...
  • 8 篇 natl inst inform...
  • 8 篇 tel aviv univ sc...

作者

  • 31 篇 xiao mingyu
  • 23 篇 tsur dekel
  • 18 篇 saurabh saket
  • 17 篇 panda b. s.
  • 16 篇 fomin fedor v.
  • 13 篇 bader david a.
  • 13 篇 bodlaender hans ...
  • 13 篇 pandey arti
  • 13 篇 lokshtanov danie...
  • 12 篇 kratsch dieter
  • 11 篇 karthick t.
  • 11 篇 de figueiredo ce...
  • 11 篇 henzinger monika
  • 11 篇 bodlaender hl
  • 11 篇 nanongkai danupo...
  • 10 篇 mcmillan scott
  • 10 篇 nagamochi hirosh...
  • 10 篇 low tze meng
  • 10 篇 dragan feodor f.
  • 9 篇 dondi riccardo

语言

  • 2,637 篇 英文
  • 287 篇 其他
  • 7 篇 中文
  • 2 篇 斯洛文尼亚文
  • 1 篇 德文
  • 1 篇 土耳其文
检索条件"主题词=Graph Algorithms"
2936 条 记 录,以下是301-310 订阅
排序:
Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization
收藏 引用
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2006年 第9期28卷 1393-1403页
作者: Lafon, Stephane Lee, Ann B. Google Inc Mountain View CA 94043 USA Carnegie Mellon Univ Dept Stat Pittsburgh PA 15213 USA
We provide evidence that nonlinear dimensionality reduction, clustering, and data set parameterization can be solved within one and the same framework. The main idea is to define a system of coordinates with an explic... 详细信息
来源: 评论
A measure of similarity between graph vertices: Applications to synonym extraction and web searching
收藏 引用
SIAM REVIEW 2004年 第4期46卷 647-666页
作者: Blondel, VD Gajardo, A Heymans, M Senellart, P Van Dooren, P Catholic Univ Louvain Div Appl Math B-1348 Louvain Belgium Univ Concepcion Dept Ingn Matemat Concepcion Chile Google Inc Mountain View CA 94043 USA Ecole Normale Super Dept Comp Sci F-75230 Paris 05 France
We introduce a concept of similarity between vertices of directed graphs. Let CA and G(B) be two directed graphs with, respectively, n(A) and n(B) vertices. We define an n(B) x n(A) similarity matrix S whose real entr... 详细信息
来源: 评论
Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices
arXiv
收藏 引用
arXiv 2024年
作者: Ganbarov, Ali Yuan, Jicheng Le-Tuan, Anh Hauswirth, Manfred Le-Phuoc, Danh Open Distributed Systems Technical University of Berlin Germany Fraunhofer Institute for Open Communication Systems Berlin Germany
In this paper, we present an experimental comparison of various graph-based approximate nearest neighbor (ANN) search algorithms deployed on edge devices for real-time nearest neighbor search applications, such as sma... 详细信息
来源: 评论
Listing all potential maximal cliques of a graph
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第1-2期276卷 17-32页
作者: Bouchitté, V Todinca, I Ecole Normale Super Lyon LIP UMR 5668 F-69364 Lyon 07 France
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs... 详细信息
来源: 评论
A survey on dynamic graph processing on GPUs: concepts, terminologies and systems
收藏 引用
Frontiers of Computer Science 2024年 第4期18卷 1-23页
作者: Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China
graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entitie... 详细信息
来源: 评论
Distributed Triangle Counting algorithms in Simple graph Stream
Distributed Triangle Counting Algorithms in Simple Graph Str...
收藏 引用
International Conference on Parallel and Distributed Systems (ICPADS)
作者: Mengdi Yu Chao Song Jiqing Gu Ming Liu School of Computer Science and Engineering University of Electronic Science and Technology of China CHINA Big Data Research Center University of Electronic Science and Technology of China CHINA
Recently, the counting algorithm of local topology structures, such as triangles, has been widely used in social network analysis, recommendation systems, user portraits and other fields. At present, one-pass streamin... 详细信息
来源: 评论
algorithms for Optimally Shifting Intervals Under Intersection graph Models
SSRN
收藏 引用
SSRN 2024年
作者: Honorato-Droguett, Nicolás Ignacio Kurita, Kazuhiro Hanaka, Tesshu Ono, Hirotaka Nagoya University Department of Mathematical Informatics Nagoya University Furo-cho Chikusa-ku Nagoya464-8601 Japan Kyushu University Department of Informatics Kyushu University Motooka Nishi-ku Fukuoka819-0395 Japan
We propose a new model for graph editing problems on intersection graphs called Geometricgraph Edit *** well-studied graph editing problems, adding and deleting vertices and edges are used as graph editing *** a graph... 详细信息
来源: 评论
Translation algorithms for graph covers
arXiv
收藏 引用
arXiv 2023年
作者: Boroński, Jan Bruin, Henk Kucharski, Przemyslaw Department of Differential Equations Faculty of Mathematics and Computer Science Jagiellonian University ul. Lojasiewicza 6 Kraków30-348 Poland Faculty of Mathematics University of Vienna Oskar Morgensternplatz 1 Vienna Austria
graph covers are a way to describe continuous maps (and homeomorphisms) of the Cantor set, more generally than e.g. Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by ... 详细信息
来源: 评论
Exploiting c-Closure in Kernelization algorithms for graph Problems
arXiv
收藏 引用
arXiv 2020年
作者: Koana, Tomohiro Komusiewicz, Christian Sommer, Frank Technische Universität Berlin Algorithmics and Computational Complexity Germany Philipps-Universität Marburg Fachbereich Mathematik und Informatik Marburg Germany
A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number c such that G is c-closed. Fox et al. [SIAM J. Comput.’20] defined c-closu... 详细信息
来源: 评论
Are graph Neural Networks Optimal Approximation algorithms?
arXiv
收藏 引用
arXiv 2023年
作者: Yau, Morris Karalias, Nikolaos Xu, Jessica Lu, Eric Jegelka, Stefanie MIT CSAIL United States Harvard University United States TUM∗and MIT United States
In this work we design graph neural network architectures that capture optimal approximation algorithms for a large class of combinatorial optimization problems, using powerful algorithmic tools from semidefinite prog... 详细信息
来源: 评论