咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是351-360 订阅
排序:
A Novel Method for Origin-Destination Flow Computation Based on Distributed Network Monitoring
A Novel Method for Origin-Destination Flow Computation Based...
收藏 引用
2011 International Conference on Frontiers in Computer Education(ICFCE 2011)
作者: Peng Ou Zhishu Li Xun Lin School of Computer Science Sichuan University School of Information Engineering Southwest University of Finance and Economy
The traditional network flow estimation requires monitoring on every node which consumes too much resourceSo how to increase the deployment of new distributed monitors as the network expanding is becoming a new resear... 详细信息
来源: 评论
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第7期158卷 765-770页
作者: Addario-Berry, Louigi Kennedy, W. S. King, Andrew D. Li, Zhentao Reed, Bruce McGill Univ Sch Comp Sci Montreal PQ Canada
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords;i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable g... 详细信息
来源: 评论
Greedy algorithms for generalized k-rankings of paths
收藏 引用
INFORMATION PROCESSING LETTERS 2010年 第22期110卷 979-985页
作者: Zemke, Andrew James, Sandra Narayan, Darren A. Rochester Inst Technol Sch Math Sci Rochester NY 14623 USA Concordia Univ Dept Math St Paul MN 55104 USA
A k-ranking of a graph is a labeling of the vertices with positive integers 1,2, ..., k so that every path connecting two vertices with the same label contains a vertex of larger label. An optimal ranking is one in wh... 详细信息
来源: 评论
Approximation to the Minimum Cost Edge Installation Problem
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年 第4期E93A卷 778-786页
作者: Morsy, Ehab Nagamochi, Hiroshi Kyoto Univ Dept Appl Math & Phys Grad Sch Informat Kyoto 6068501 Japan
We consider the minimum cost edge installation problem (MCEI) in a graph G = (V, E) with edge weight w(e) >= 0. e is an element of E We are given a vertex s is an element of V designated as a sink, an edge capacity... 详细信息
来源: 评论
Solving path problems on the GPU
收藏 引用
PARALLEL COMPUTING 2010年 第5-6期36卷 241-253页
作者: Buluc, Aydin Gilbert, John R. Budak, Ceren Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA
We consider the computation of shortest paths on graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as all-pairs shortest-paths, transitive ... 详细信息
来源: 评论
Crossing minimization in extended level drawings of graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第3期158卷 159-179页
作者: Bachmaier, Christian Buchner, Hedi Forster, Michael Hong, Seok-Hee Univ Passau Fac Inf & Math D-94030 Passau Germany Natl ICT Australia IMAGEN Program Eveleigh NSW 1430 Australia Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia
The most popular method of drawing directed graphs is to place vertices on a set of horizontal or concentric levels, known as level drawings. Level drawings are well studied in graph Drawing due to their strong applic... 详细信息
来源: 评论
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2010年 第4期70卷 406-415页
作者: Guellati, Nabil Kheddouci, Hamamache Univ Abderrahmane Mira Dept Comp Sci Bejaia Algeria Univ Lyon 1 LIESP Lab F-69365 Lyon France
Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the concept of self-stabil... 详细信息
来源: 评论
Simple and Improved Parameterized algorithms for Multiterminal Cuts
收藏 引用
THEORY OF COMPUTING SYSTEMS 2010年 第4期46卷 723-736页
作者: Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 610054 Peoples R China
Given a graph G = (V, E) with n vertices and m edges, and a subset T of k vertices called terminals, the Edge (respectively, Vertex) Multiterminal Cut problem is to find a set of at most l edges (non-terminal vertices... 详细信息
来源: 评论
Approximation algorithms for Minimizing Edge Crossings in Radial Drawings
收藏 引用
algorithmICA 2010年 第2期58卷 478-497页
作者: Hong, Seok-Hee Nagamochi, Hiroshi Kyoto Univ Dept Appl Math & Phys Kyoto 606 Japan Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia
We study a crossing minimization problem of drawing a bipartite graph with a radial drawing of two orbits. Radial drawings are one of well-known drawing conventions in social network analysis and visualization, in par... 详细信息
来源: 评论
Complexity of the packing coloring problem for trees
收藏 引用
DISCRETE APPLIED MATHEMATICS 2010年 第7期158卷 771-778页
作者: Fiala, Jiri Golovach, Petr A. Univ Bergen Dept Informat N-5020 Bergen Norway Charles Univ Prague Dept Appl Math CR-11800 Prague Czech Republic Charles Univ Prague Inst Theoret Comp Sci ITI CR-11800 Prague Czech Republic
Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise distance greater than i. The main result of this paper is a solution of an open problem o... 详细信息
来源: 评论