咨询与建议

限定检索结果

文献类型

  • 362 篇 期刊文献
  • 145 篇 会议
  • 5 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

  • 512 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 15 篇 tree
  • 13 篇 combinatorial re...
  • 12 篇 computational co...
  • 12 篇 shortest path
  • 11 篇 minimum spanning...
  • 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

语言

  • 453 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph algorithm"
512 条 记 录,以下是241-250 订阅
排序:
Reconfiguration of Vertex Covers in a graph
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2016年 第3期E99D卷 598-606页
作者: Ito, Takehiro Nooka, Hiroyuki Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai 9808579 Japan
Suppose that we are given two vertex covers C-0 and C-t of a graph G, together with an integer threshold k >= max {vertical bar C-0 vertical bar, vertical bar C-t vertical bar}. Then, the VERTEX COVER RECONFIGURATI... 详细信息
来源: 评论
Brief Announcement: Asynchronous Coordination with Constraints and Preferences  16
Brief Announcement: Asynchronous Coordination with Constrain...
收藏 引用
35th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)
作者: Castaneda, Armando Fraigniaud, Pierre Gafni, Eli Rajsbaum, Sergio Roy, Matthieu Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Paris Diderot CNRS IRIF Paris France Univ Calif Los Angeles CS Dept Los Angeles CA USA Univ Toulouse CNRS LAAS Toulouse France
Adaptive renaming can be viewed as a coordination task involving a set of asynchronous agents, each aiming at grabbing a single resource out of a set of resources totally ordered by their desirability. We consider a g... 详细信息
来源: 评论
b-Disjunctive Total Domination in graphs: algorithm and Hardness Results  2nd
b-Disjunctive Total Domination in Graphs: Algorithm and Hard...
收藏 引用
2nd International Conference on algorithms and Discrete Applied Mathematics (CALDAM)
作者: Pandey, Arti Panda, B. S. Indian Inst Informat Technol Guwahati Dept Comp Sci & Engn GN Bordoloi Rd Gauhati 781001 India Indian Inst Technol Dept Math Kharagpur 721302 W Bengal India
Let G = (V, E) be a connected graph with at least two vertices. For a fixed positive integer b > 1, a set D subset of V is called a b-disjunctive total dominating set of G if for every vertex v is an element of V, ... 详细信息
来源: 评论
PTE: Enumerating Trillion Triangles On Distributed Systems  16
PTE: Enumerating Trillion Triangles On Distributed Systems
收藏 引用
22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)
作者: Park, Ha-Myung Myaeng, Sung-Hyon Kang, U. Korea Adv Inst Sci & Technol Daejeon South Korea Seoul Natl Univ Seoul South Korea
How can we enumerate triangles from an enormous graph with billions of vertices and edges? Triangle enumeration is an important task for graph data analysis with many applications including identifying suspicious user... 详细信息
来源: 评论
Optimal algorithms for graphs and Images on a Shared Memory Mesh  30
Optimal Algorithms for Graphs and Images on a Shared Memory ...
收藏 引用
30th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
作者: An, Yujie Stout, Quentin F. Univ Michigan Comp Sci & Engn Ann Arbor MI 48109 USA
In this paper we combine aspects of the PRAM and mesh models to achieve the benefits of each. Many fast algorithms are known for the PRAM, but it is unrealistic to build. Another well-known model is the 2-dimensional ... 详细信息
来源: 评论
An Efficient Greedy Minimum Spanning Tree algorithm Based on Vertex Associative Cycle Detection Method  2
An Efficient Greedy Minimum Spanning Tree Algorithm Based on...
收藏 引用
2nd International Conference on Intelligent Computing, Communication & Convergence (ICCC)
作者: Biswas, Prantik Goel, Mansi Negi, Harshita Datta, Megha Natl Inst Technol Kurukshetra 136119 Haryana India
The minimal spanning tree problem is a popular problem of discrete optimization. Numerous algorithms have been developed using the traditional approach but with the emergence of modern-day complex data structures, new... 详细信息
来源: 评论
Performance Analysis of Spark/graphX on POWER8 Cluster
Performance Analysis of Spark/GraphX on POWER8 Cluster
收藏 引用
International Supercomputing Conference (ISC High Performance)
作者: Que, Xinyu Schneidenbach, Lars Checconi, Fabio Costa, Carlos H. A. Buono, Daniele IBM TJ Watson Yorktown Hts NY 10598 USA
POWER8, the latest RISC (Reduced Instruction Set Computer) microprocessor of the IBM Power architecture family, was designed to significantly benefit emerging workloads, including Business Analytics, Cloud Computing a... 详细信息
来源: 评论
Application of Fuzzy Sections for Constructing Dynamic Routing in the Network DTN  16th
Application of Fuzzy Sections for Constructing Dynamic Routi...
收藏 引用
16th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networks and Systems (NEW2AN) / 9th Conference on Internet of Things and Smart Spaces Are You Smart (ruSMART)
作者: Shichkina, Yulia Kupriyanov, Mikhail Plotnikova, Anastasia Domaratsky, Yaroslav St Petersburg Electrotech Univ LETI Dept Comp Sci & Engn St Petersburg Russia Motorola Solut Inc Technol Off Schaumburg IL USA
This article provides a methodology for construction of data transfer paths through DTN dynamic network, implemented with the devices mounted on moving objects and connected via WI-FI, Bluetooth and LTE D2D. The metho... 详细信息
来源: 评论
Efficient graph computation on hybrid CPU and GPU systems
收藏 引用
JOURNAL OF SUPERCOMPUTING 2015年 第4期71卷 1563-1586页
作者: Zhang, Tao Zhang, Jingjie Shu, Wei Wu, Min-You Liang, Xiaoyao Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200240 Peoples R China Fudan Univ Dept Elect Engn Shanghai 200433 Peoples R China
graphs are used to model many real objects such as social networks and web graphs. Many real applications in various fields require efficient and effective management of large-scale, graph-structured data. Although di... 详细信息
来源: 评论
COMPLEX NETWORK PARTITIONING USING LABEL PROPAGATION
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2016年 第5期38卷 S620-S645页
作者: Slota, George M. Madduri, Kamesh Rajamanickam, Sivasankaran Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA Sandia Natl Labs Scalable Algorithms Dept Albuquerque NM 87123 USA
We present PuLP (partitioning using label propagation), a parallel and memory efficient graph partitioning method specifically designed to partition low-diameter networks with skewed degree distributions on shared-mem... 详细信息
来源: 评论