咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 515 篇 电子文献
  • 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 篇 农学

主题

  • 515 篇 graph algorithm
  • 51 篇 approximation al...
  • 18 篇 np-complete
  • 17 篇 domination
  • 15 篇 tree
  • 13 篇 computational co...
  • 13 篇 combinatorial re...
  • 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

语言

  • 456 篇 英文
  • 57 篇 其他
  • 2 篇 中文
检索条件"主题词=Graph Algorithm"
515 条 记 录,以下是251-260 订阅
排序:
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Near-Optimal Placement of Secrets in graphs
收藏 引用
Open Journal of Discrete Mathematics 2016年 第4期6卷 238-247页
作者: Werner Poguntke Fachbereich Technische Betriebwirtschaft Fachhochschule Südwestfalen Hagen Germany
We consider the reconstruction of shared secrets in communication networks, which are modelled by graphs whose components are subject to possible failure. The reconstruction probability can be approximated using minim... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Strong minimum energy -hop rooted topology for hierarchical wireless sensor networks
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2015年 第4期30卷 1077-1094页
作者: Panda, B. S. Shetty, D. Pushparaj Indian Inst Technol Delhi Dept Math Comp Sci & Applicat Grp New Delhi 110016 India
Given a set of sensors, the strong minimum energy topology (SMET) problem is to assign transmit power to each sensor such that the sum of the transmit powers of all the sensors is minimum subject to the constraint tha... 详细信息
来源: 评论
Swapping labeled tokens on graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 586卷 81-94页
作者: Yamanaka, Katsuhisa Demaine, Erik D. Ito, Takehiro Kawahara, Jun Kiyomi, Masashi Okamoto, Yoshio Saitoh, Toshiki Suzuki, Akira Uchizawa, Kei Uno, Takeaki Iwate Univ Dept Elect Engn & Comp Sci Morioka Iwate 0208551 Japan MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Nara Inst Sci & Technol Grad Sch Informat Sci Ikoma Nara 6300192 Japan Yokohama City Univ Int Coll Arts & Sci Kanazawa Ku Yokohama Kanagawa 2360027 Japan Univ Electrocommun Dept Commun Engn & Informat Chofu Tokyo 1828585 Japan Kobe Univ Grad Sch Engn Nada Ku Kobe Hyogo 6578501 Japan Yamagata Univ Grad Sch Sci & Engn Yonezawa Yamagata 9928510 Japan Natl Inst Informat Principles Informat Res Div Chiyoda Ku Tokyo 1018430 Japan
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens ... 详细信息
来源: 评论
On the tractability of some natural packing, covering and partitioning problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 180卷 25-35页
作者: Bernath, Attila Kiraly, Zoltan Hungarian Acad Sci Inst Comp Sci & Control MTA SZTAKI Budapest Hungary Eotvos Lorand Univ Dept Comp Sci Budapest Hungary Eotvos Lorand Univ Egervary Res Grp MTA ELTE Budapest Hungary
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph G = (V, E) and two &... 详细信息
来源: 评论
Finding a Friendly Community in Social Networks Considering Bad Relationships
收藏 引用
COMPUTER JOURNAL 2015年 第6期58卷 1469-1481页
作者: Kim, Sang-Yeon Choi, Dong-Wan Chung, Chin-Wan Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea
Community detection in social networks is one of the most active problems with lots of applications. Most of the existing works on the problem have focused on detecting the community considering only the closeness bet... 详细信息
来源: 评论