咨询与建议

限定检索结果

文献类型

  • 363 篇 期刊文献
  • 145 篇 会议
  • 10 篇 学位论文

馆藏范围

  • 518 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 409 篇 工学
    • 379 篇 计算机科学与技术...
    • 94 篇 软件工程
    • 64 篇 电气工程
    • 23 篇 信息与通信工程
    • 19 篇 电子科学与技术(可...
    • 15 篇 控制科学与工程
    • 7 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 仪器科学与技术
    • 3 篇 材料科学与工程(可...
    • 3 篇 化学工程与技术
    • 3 篇 生物医学工程(可授...
    • 1 篇 力学(可授工学、理...
  • 211 篇 理学
    • 189 篇 数学
    • 13 篇 生物学
    • 7 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 5 篇 化学
    • 5 篇 系统科学
    • 1 篇 地球物理学
  • 37 篇 管理学
    • 34 篇 管理科学与工程(可...
    • 12 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 13 篇 经济学
    • 13 篇 应用经济学
  • 12 篇 医学
    • 6 篇 临床医学
    • 4 篇 基础医学(可授医学...
    • 4 篇 特种医学
  • 2 篇 文学
    • 2 篇 新闻传播学
  • 1 篇 哲学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 农学

主题

  • 518 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 16 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 12 篇 minimum spanning...
  • 12 篇 shortest path
  • 11 篇 chordal graph
  • 11 篇 combinatorial op...
  • 10 篇 gpu
  • 9 篇 graph theory
  • 9 篇 ordering
  • 9 篇 parallel algorit...
  • 9 篇 network optimiza...
  • 8 篇 planar graph
  • 8 篇 interval graphs
  • 8 篇 reordering algor...
  • 7 篇 apx-complete

机构

  • 13 篇 tohoku univ grad...
  • 10 篇 univ elect sci &...
  • 7 篇 kyoto univ grad ...
  • 6 篇 indian inst tech...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 5 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 tohoku univ grad...
  • 4 篇 univ sydney sch ...
  • 4 篇 osaka prefecture...
  • 4 篇 univ tokushima d...
  • 4 篇 mit comp sci & a...
  • 4 篇 otaru univ dept ...
  • 4 篇 fudan univ sch c...
  • 4 篇 univ bergen dept...
  • 4 篇 univ helsinki de...
  • 4 篇 shandong univ sc...
  • 3 篇 georgia inst tec...
  • 3 篇 tsinghua univ de...

作者

  • 25 篇 ito takehiro
  • 19 篇 nagamochi hirosh...
  • 16 篇 panda b. s.
  • 13 篇 ono hirotaka
  • 10 篇 zhou xiao
  • 10 篇 tarjan re
  • 9 篇 pandey arti
  • 9 篇 xiao mingyu
  • 8 篇 ishii toshimasa
  • 8 篇 otachi yota
  • 7 篇 suzuki akira
  • 7 篇 morsy ehab
  • 7 篇 zhang zhongzhi
  • 6 篇 uno yushi
  • 5 篇 paul s.
  • 5 篇 cui bin
  • 5 篇 kawahara jun
  • 5 篇 qin lu
  • 5 篇 chen lei
  • 5 篇 lin xuemin

语言

  • 459 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
518 条 记 录,以下是61-70 订阅
排序:
Subgraph isomorphism in graph classes
收藏 引用
DISCRETE MATHEMATICS 2012年 第21期312卷 3164-3173页
作者: Kijima, Shuji Otachi, Yota Saitoh, Toshiki Uno, Takeaki Kobe Univ Grad Sch Engn Kobe Hyogo 6578501 Japan Kyushu Univ Grad Sch Informat Sci & Elect Engn Fukuoka 8190395 Japan Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Ishikawa 9231292 Japan Natl Inst Informat Tokyo 1018430 Japan
We investigate the computational complexity of the following restricted variant of SUBgraph ISOMORPHISM: given a pair of connected graphs G = (V-G, E-G) and H = (V-H, E-H), determine if H is isomorphic to a spanning s... 详细信息
来源: 评论
Maintaining the classes of 4-edge-connectivity in a graph on-line
收藏 引用
algorithmICA 1998年 第3期20卷 242-276页
作者: Dinitz, Y Westbrook, J Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel AT&T Bell Labs Res Florham Pk NJ 07932 USA Yale Univ Dept Comp Sci New Haven CT 06520 USA
Two vertices of an undirected graph are called k-edge-connected if there exist k edge-disjoint paths between them (equivalently, they cannot be disconnected by the removal of less than k edges from the graph). Equival... 详细信息
来源: 评论
Automata for the verification of monadic second-order graph properties
收藏 引用
JOURNAL OF APPLIED LOGIC 2012年 第4期10卷 368-409页
作者: Courcelle, Bruno Durand, Irene Univ Bordeaux Labri CNRS F-33405 Talence France
The model-checking problem for monadic second-order logic on graphs is fixed-parameter tractable with respect to tree-width and clique-width. The proof constructs finite automata from monadic second-order sentences. T... 详细信息
来源: 评论
An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored graph  34th
An Explainable Recommendation Based on Acyclic Paths in an E...
收藏 引用
34th Australasian Joint Conference on Artificial Intelligence (AI)
作者: Chinone, Kosuke Nakamura, Atsuyoshi Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Hokkaido Japan
We propose a novel recommendation algorithm based on acyclic paths in an edge-colored graph. In our method, all the objects including users, items to recommend, and other things usable to recommendation are represente... 详细信息
来源: 评论
Exploring Network Optimizations for Large-Scale graph Analytics  15
Exploring Network Optimizations for Large-Scale Graph Analyt...
收藏 引用
International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
作者: Que, Xinyu Checconi, Fabio Petrini, Fabrizio Liu, Xing Buono, Daniele IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
graph analytics are arguably one of the most demanding workloads for high-performance systems and interconnection networks. graph applications often display all-to-all, fine-grained, high-rate communication patterns t... 详细信息
来源: 评论
Manipulating Structural graph Clustering  38
Manipulating Structural Graph Clustering
收藏 引用
38th IEEE International Conference on Data Engineering (ICDE)
作者: Li, Wentao Gao, Min Wen, Dong Zhou, Hongwei Ke, Cai Qin, Lu Univ Technol Sydney FEIT AAII Ultimo Australia Chongqing Univ Chongqing Peoples R China Univ New South Wales Sydney NSW Australia
Structural graph clustering (SCAN) is a popular clustering technique. Using the concept of is an element of-neighborhood, SCAN defines the core vertices that uniquely determine the clusters of a graph. Most existing s... 详细信息
来源: 评论
A Biologically Plausible graph Structure for AGI  15th
A Biologically Plausible Graph Structure for AGI
收藏 引用
15th International Conference on Artificial General Intelligence (AGI)
作者: Simon, Charles J. Future AI Washington DC 20036 USA
graph structures have shown to represent a viable approach to developingAGI. This paper describes howa knowledge graph could be represented in neurons and introduces theUniversal Knowledge Store (UKS), an open-source ... 详细信息
来源: 评论
Dynamic graph Repartitioning: From Single Vertex to Vertex Group  25th
Dynamic Graph Repartitioning: From Single Vertex to Vertex G...
收藏 引用
25th International Conference on Database Systems for Advanced Applications (DASFAA)
作者: Li, He Yuan, Hang Huang, Jianbin Cui, Jiangtao Yoo, Jaesoo Xidian Univ Sch Comp Sci & Technol Xian Shaanxi Peoples R China Chungbuk Natl Univ Dept Informat & Commun Engn Cheongju Chungbuk South Korea
With the increase of large graph data arising in applications like Web, social network, knowledge graph, and so on, there is a growing need for partitioning and repartitioning large graph data in graph data systems. H... 详细信息
来源: 评论
An Efficient Indexing Method for Dynamic graph kNN  35th
An Efficient Indexing Method for Dynamic Graph kNN
收藏 引用
35th International Conference on Database and Expert Systems Applications (DEXA)
作者: Matsugu, Shohei Kobayashi, Suomi Shiokawa, Hiroaki Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan Univ Tsukuba Grad Sch Sci & Technol Tsukuba Ibaraki Japan
k-nearest neighbor (kNN) search is a fundamental problem in graph mining. This search finds the k most relevant nodes to a given query node. The increased use of social network services and map applications due to the... 详细信息
来源: 评论
Augmenting graph Convolution with Distance Preserving Embedding for Improved Learning  22
Augmenting Graph Convolution with Distance Preserving Embedd...
收藏 引用
22nd IEEE International Conference on Data Mining (ICDM)
作者: Cong, Guojing Lim, Seung-Hwan Young, Steven Oakridge Natl Lab Oakridge TN 37830 USA
graph convolution incorporates topological information of a graph into learning. Message passing corresponds to traversal of a local neighborhood in classical graph algorithms. We show that incorporating additional gl... 详细信息
来源: 评论