咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 410 篇 工学
    • 380 篇 计算机科学与技术...
    • 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 篇 农学

主题

  • 519 篇 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

语言

  • 460 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
519 条 记 录,以下是31-40 订阅
A Two-Phase Method to Balance the Result of Distributed graph Repartitioning
收藏 引用
IEEE TRANSACTIONS ON BIG DATA 2022年 第6期8卷 1580-1591页
作者: Li, He Huang, Jianbin Yuan, Hang Cui, Jiangtao Ma, Xiaoke Qiao, Shaojie Wu, Xindong Xidian Univ Sch Comp Sci & Technol Xian 710126 Shaanxi Peoples R China Chengdu Univ Informat Technol Sch Software Engn Chengdu 610225 Sichuan Peoples R China Mininglamp Acad Sci Mininglamp Technol Beijing 100102 Peoples R China Hefei Univ Technol Key Lab Knowledge Engn Big Data Hefei 230009 Anhui Peoples R China
With the increase in popularity of graph structured data arising in different areas such as Web, social network, communication network, knowledge graph, etc., there is a growing need for partitioning and repartitionin... 详细信息
来源: 评论
Hardness Results of Connected Power Domination for Bipartite graphs and Chordal graphs
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2024年 第6期35卷 669-703页
作者: Goyal, Pooja Panda, B. S. Indian Inst Technol Delhi Dept Math New Delhi 110016 India
A set D subset of V of a graph G = (V, E) is called a connected power dominating set of G if G[D], the subgraph induced by D, is connected and every vertex in the graph can be observed from D, following the two observ... 详细信息
来源: 评论
A graph-based algorithm for three-way merging of ordered collections in EMF models
收藏 引用
SCIENCE OF COMPUTER PROGRAMMING 2015年 第Part1期113卷 51-81页
作者: Schwaegerl, Felix Uhrig, Sabrina Westfechtel, Bernhard Univ Bayreuth Chair Appl Comp Sci 1 D-95440 Bayreuth Germany
In EMF models, ordered collections appear as the values of multi-valued structural features. Traditional, text-based version control systems do not sufficiently support three-way merging of ordered collections inside ... 详细信息
来源: 评论
Friedkin-Johnsen Model for Opinion Dynamics on Signed graphs
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2024年 第12期36卷 8313-8327页
作者: Zhou, Xiaotian Sun, Haoxin Xu, Wanyue Li, Wei Zhang, Zhongzhi Fudan Univ Sch Comp Sci Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China Fudan Univ Acad Engn & Technol Shanghai 200433 Peoples R China
A signed graph offers richer information than an unsigned graph, since it describes both collaborative and competitive relationships in social networks. In this paper, we study opinion dynamics on a signed graph, base... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
TEA: A General-Purpose Temporal graph Random Walk Engine  23
TEA: A General-Purpose Temporal Graph Random Walk Engine
收藏 引用
18th European Conference on Computer Systems (EuroSys)
作者: Huan, Chengying Song, Shuaiwen Leon Pandey, Santosh Liu, Hang Liu, Yongchao Lepers, Baptiste He, Changhua Chen, Kang Jiang, Jinlei Wu, Yongwei Tsinghua Univ Beijing Peoples R China Baihai Technol Inc Guangzhou Peoples R China Univ Sydney Sydney NSW Australia Stevens Inst Technol Hoboken NJ USA Ant Grp Hangzhou Peoples R China Univ Neuchatel Neuchatel Switzerland
Many real-world graphs are temporal in nature, where the temporal information indicates when a particular edge is changed (e.g., edge insertion and deletion). Performing random walks on such temporal graphs is of para... 详细信息
来源: 评论
APPROXIMATE GOMORY--HU TREE IS FASTER THAN n-1 MAXIMUM FLOWS
收藏 引用
SIAM JOURNAL ON COMPUTING 2024年 第4期53卷 1162-1180页
作者: Li, Jason Panigrahi, Debmalya Carnegie Mellon Univ Pittsburgh PA 15213 USA Duke Univ Dept Comp Sci Durham NC 27708 USA
The Gomory-Hu tree or cut tree [R. E. Gomory and T. C. Hu, J. Soc. Indust. Appl. Math., 9 (1961), pp. 55--570] is a classic data structure for reporting (s,t)-mincuts (and by duality, the values of (s, t)-maxflows) fo... 详细信息
来源: 评论
Balanced Clique Computation in Signed Networks: Concepts and algorithms
收藏 引用
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2023年 第11期35卷 11079-11092页
作者: Chen, Zi Yuan, Long Lin, Xuemin Qin, Lu Zhang, Wenjie East China Normal Univ Software Engn Inst Shanghai 200050 Peoples R China Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Peoples R China Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia Univ Technol Ctr QCIS Sydney NSW 2007 Australia
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. However, in real world, many applications are modeled as signed... 详细信息
来源: 评论
An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期341卷 93-101页
作者: Ono, Hirotaka Yamanaka, Hisato Nagoya Univ Grad Sch Informat Dept Math Informat Chikusa ku Nagoya Aichi 4648601 Japan Kozo Keikaku Engn Inc 4-5-3 Chuo Nakano ku Tokyo 1640011 Japan
Given a graph G = (V, E), an L(2, 1)-labeling of the graph is an assignment l from the vertex set to the set of nonnegative integers such that for any pair of vertices (u, v), vertical bar l(u) - l(v)vertical bar >... 详细信息
来源: 评论
Happy Set Problem on Subclasses of Co-comparability graphs
收藏 引用
algorithmICA 2023年 第11期85卷 3327-3347页
作者: Eto, Hiroshi Ito, Takehiro Miyano, Eiji Suzuki, Akira Tamura, Yuma Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Kyushu Inst Technol Sch Comp Sci & Syst Engn Iizuka Fukuoka 8208502 Japan
In this paper, we investigate the complexity of the MAXIMUM HAPPY SET problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S, a vertex v is an element of S is happy if all v's neig... 详细信息
来源: 评论