咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是321-330 订阅
排序:
Enumerating All Rooted Trees Including k Leaves
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2012年 第3期E95D卷 763-768页
作者: Ishikawa, Masanobu Yamanaka, Katsuhisa Otachi, Yota Nakano, Shin-ichi Gunma Univ Dept Comp Sci Kiryu Gunma 3768515 Japan Iwate Univ Dept Elect Engn & Comp Sci Morioka Iwate 0208551 Japan Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
This paper presents an efficient algorithm to generate all (unordered) rooted trees with exactly vertices including exactly k leaves. There are known results on efficient enumerations of some classes of graphs embedde... 详细信息
来源: 评论
ON 3-COLORABLE P5-FREE graphS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2012年 第4期26卷 1682-1708页
作者: Maffray, Frederic Morel, Gregory CNRS Lab G SCOP F-38031 Grenoble France UJF Grenoble 1 Lab G SCOP F-38031 Grenoble France
A graph is P-5-free when it does not contain a P-5 (that is, a path with five vertices) as an induced subgraph. The class of P-5-free graphs is of particular interest, especially with respect to the still unknown comp... 详细信息
来源: 评论
An Improved Sufficient Condition Tor Reconfiguration of List Edge-Colorings in a Tree
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2012年 第3期E95D卷 737-745页
作者: Ito, Takehiro Kawamura, Kazuto Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing only one edge color assignment at a time, while at all times maintaining a list edge-coloring, given ... 详细信息
来源: 评论
A linear time algorithm for 7-coloring triangle-free hexagonal graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2012年 第14-15期112卷 567-571页
作者: Sparl, Petra Witkowski, Rafal Zerovnik, Janez Inst Math Phys & Mech Ljubljana Slovenia Univ Maribor Fac Org Sci SI-4000 Kranj Slovenia Adam Mickiewicz Univ Fac Math & Comp Sci Poznan Poland Univ Ljubljana Fac Mech Engn SI-1000 Ljubljana Slovenia
Given a graph G and p is an element of N, a proper n-[p]coloring is a mapping f : V (G) -> 2((1....,n)) such that vertical bar f(v)vertical bar = p for any vertex v is an element of V (G) and f(v) boolean AND (u) =... 详细信息
来源: 评论
Improving search via personalized query expansion using social media
收藏 引用
INFORMATION RETRIEVAL 2012年 第3-4期15卷 218-242页
作者: Zhou, Dong Lawless, Seamus Wade, Vincent Trinity Coll Dublin Sch Comp Sci & Stat Knowledge & Data Engn Grp Ctr Next Generat Localisat Dublin 2 Ireland
Social tagging systems have gained increasing popularity as a method of annotating and categorizing a wide range of different web resources. Web search that utilizes social tagging data suffers from an extreme example... 详细信息
来源: 评论
The (p, q)-total labeling problem for trees
收藏 引用
DISCRETE MATHEMATICS 2012年 第8期312卷 1407-1420页
作者: Hasunuma, Toru Ishii, Toshimasa Ono, Hirotaka Uno, Yushi Otani Univ Commerce Dept Informat & Management Sci Otaru Hokkaido 0478501 Japan Univ Tokushima Dept Math & Nat Sci Tokushima 7708502 Japan Kyushu Univ Dept Econ Engn Fukuoka 8128581 Japan Osaka Prefecture Univ Dept Math & Informat Sci Grad Sch Sci Sakai Osaka 5998531 Japan
A (p, q)-total labeling of a graph G is an assignment f from the vertex set V (G) and the edge set E(G) to the set of nonnegative integers such that left perpendicularf(x) - f (y)right perpendicular >= p if x is a ... 详细信息
来源: 评论
Simpler multicoloring of triangle-free hexagonal graphs
收藏 引用
DISCRETE MATHEMATICS 2012年 第1期312卷 181-187页
作者: Sau, Ignasi Sparl, Petra Zerovnik, Janez Univ Ljubljana FS Ljubljana 1000 Slovenia CNRS LIRMM F-34095 Montpellier 5 France Univ Maribor FOV SI-4000 Kranj Slovenia IMFM Ljubljana Slovenia
Given a graph G and a demand function p: V(G) -> N, a proper n-[p]coloring is a mapping f : V(G) -> 2([1.....n]) such that vertical bar f (v)vertical bar >= p(v) for every vertex v epsilon V(G) and f(v) boole... 详细信息
来源: 评论
Extracting research communities from bibliographic data
收藏 引用
INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS 2012年 第1期16卷 25-34页
作者: Nakamura, Yushi Horiike, Toshihiko Kuboyama, Tetsuji Sakamoto, Hiroshi Kyushu Inst Technol 680-4 Kawazu Iizuka Fukuoka 8208502 Japan Gakushuin Univ Tokyo Japan JST PRESTO Kawaguchi Saitama Japan
We develop a research community extraction algorithm from large bibliographic data, which was preliminarily reported in Horiike et al. [10] and Nakamura et al. [18]. A research community in bibliographic data is consi... 详细信息
来源: 评论
Weighted Matching in the Semi-Streaming Model
收藏 引用
algorithmICA 2012年 第1-2期62卷 1-20页
作者: Zelke, Mariano Goethe Univ Frankfurt Inst Informat D-60054 Frankfurt Germany
We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model. The semi-streaming model forbids random access to the input graph and restricts the memory to O(*** n)... 详细信息
来源: 评论
A Novel Method for Origin-Destination Flow Computation Based on Distributed Network Monitoring
A Novel Method for Origin-Destination Flow Computation Based...
收藏 引用
International Conference on Frontiers in Computer Education (ICFCE 2011)
作者: Ou, Peng Li, Zhishu Lin, Xun Sichuan Univ Sch Comp Sci Chengdu 610064 Peoples R China Southwest Univ Finance Economy Sch Informat Engn Turku Finland
The traditional network flow estimation requires monitoring on every node which consumes too much resource. So how to increase the deployment of new distributed monitors as the network expanding is becoming a new rese... 详细信息
来源: 评论