咨询与建议

限定检索结果

文献类型

  • 107 篇 期刊文献
  • 17 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 87 篇 理学
    • 87 篇 数学
    • 3 篇 统计学(可授理学、...
  • 57 篇 工学
    • 51 篇 计算机科学与技术...
    • 15 篇 软件工程
    • 10 篇 电气工程
    • 8 篇 电子科学与技术(可...
    • 2 篇 机械工程
    • 2 篇 信息与通信工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 材料科学与工程(可...
    • 1 篇 控制科学与工程
  • 22 篇 管理学
    • 22 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 4 篇 经济学
    • 4 篇 应用经济学

主题

  • 124 篇 series-parallel ...
  • 12 篇 algorithm
  • 11 篇 planar graph
  • 9 篇 outerplanar grap...
  • 7 篇 labeled graph
  • 6 篇 enumeration
  • 6 篇 dynamic programm...
  • 5 篇 partial k-tree
  • 5 篇 2-tree
  • 5 篇 scheduling
  • 5 篇 complexity
  • 4 篇 graph
  • 4 篇 girth
  • 4 篇 demand
  • 4 篇 supply
  • 4 篇 two-terminal dir...
  • 4 篇 facet
  • 4 篇 spanning tree
  • 4 篇 decomposition
  • 3 篇 chromatic number

机构

  • 11 篇 tohoku univ grad...
  • 4 篇 department of co...
  • 3 篇 wesleyan univ de...
  • 3 篇 univ politecn ca...
  • 3 篇 zhejiang normal ...
  • 3 篇 kwansei gakuin u...
  • 2 篇 carleton univ sc...
  • 2 篇 cea list embedde...
  • 2 篇 univ libre bruxe...
  • 2 篇 natl sun yat sen...
  • 2 篇 ben gurion univ ...
  • 2 篇 departament de m...
  • 2 篇 sobolev inst mat...
  • 2 篇 univ paris 13 so...
  • 2 篇 univ nottingham ...
  • 2 篇 russian institut...
  • 2 篇 sorbonne univ up...
  • 2 篇 nyu dept phys ny...
  • 2 篇 shandong univ sc...
  • 2 篇 xidian univ dept...

作者

  • 11 篇 nishizeki takao
  • 10 篇 zhou xiao
  • 5 篇 korenblit mark
  • 5 篇 ito takehiro
  • 5 篇 nishizeki t
  • 4 篇 grappe roland
  • 4 篇 wang ji-bo
  • 4 篇 zhou x
  • 4 篇 lacroix mathieu
  • 3 篇 morin pat
  • 3 篇 voblyi v.a.
  • 3 篇 bose prosenjit
  • 3 篇 wood david r.
  • 3 篇 wuhrer stefanie
  • 3 篇 levit vadim e.
  • 3 篇 de mier anna
  • 3 篇 wu jianliang
  • 3 篇 zhu xd
  • 3 篇 noy marc
  • 3 篇 langerman stefan

语言

  • 109 篇 英文
  • 14 篇 其他
  • 1 篇 中文
检索条件"主题词=Series-parallel Graph"
124 条 记 录,以下是81-90 订阅
排序:
Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2007年 第2期E90D卷 449-456页
作者: Ito, Takehiro Goto, Kazuya Zhou, Xiao Nishizeki, Takao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers l(i) and u(i), 1 <= i <= q, are given. One wishes to partition G into... 详细信息
来源: 评论
An algorithm for solving the minimum vertex-ranking spanning tree problem on series-parallel graphs
An algorithm for solving the minimum vertex-ranking spanning...
收藏 引用
4th International Conference on Electrical and Computer Engineering
作者: Kashem, Md. Abul Hasan, Chowdhury Sharif Bhattacharjee, Anupam Bangladesh Univ Engn & Technol Dept Comp Sci & Engn Dhaka 1000 Bangladesh
A vertex-ranking of a graph G is a labeling of the vertices of G with positive integers such that every path between two vertices with the same label i contains a vertex with label j > i. The minimum vertex-ranking... 详细信息
来源: 评论
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2006年 第10期33卷 3015-3033页
作者: Kaspi, M Shabtay, D Ben Gurion Univ Negev Dept Ind Engn & Management IL-84105 Beer Sheva Israel
This paper presents a bicriterion analysis of time/cost trade-offs for the single-machine scheduling problem where both job processing times and release dates are controllable by the allocation of a continuously nonre... 详细信息
来源: 评论
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2006年 第1期4卷 142-154页
作者: Ito, Takehiro Zhou, Xiao Nishizeki, Takao Tohoku Univ Grad Sch Informat Sci Aobayama 6-6-05 Sendai Miyagi 9808579 Japan
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by deleting edges from G so that the total w... 详细信息
来源: 评论
Nested graphs
收藏 引用
Electronic Notes in Discrete Mathematics 2006年 24卷 93-99页
作者: Korenblit, Mark Levit, Vadim E. Department of Computer Science Holon Institute of Technology Holon Israel Department of Computer Science Holon Institute of Technology Holon Israel
We define a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. It is proved that every nested graph is series-parallel as well. We show that an... 详细信息
来源: 评论
Generating all series-parallel graphs
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2005年 第5期E88A卷 1129-1135页
作者: Kawano, S Nakano, S Gunma Univ Dept Comp Sci Kiryu Gumma 3768515 Japan
In this paper we give an algorithm to generates all series-parallel graphs with at most m edges. This algorithm generate each series-parallel graph in constant time on average.
来源: 评论
List total colorings of series-parallel graphs
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2005年 第1期3卷 47-60页
作者: Zhou, Xiao Matsuo, Yuki Nishizeki, Takao Tohoku Univ Aobayama Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
A total coloring of a graph G is a coloring of all elements of G, i.e., vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each ... 详细信息
来源: 评论
The determination of the total chromatic number of series-parallel graphs with (G) ≥ 4
收藏 引用
graphS AND COMBINATORICS 2005年 第4期21卷 531-540页
作者: Wang, SD Pang, SC Shandong Univ Sci & Technol Coll Informat Sci & Engn Tai An 271019 Shandong Peoples R China
The total chromatic number of series-parallel graphs of maximum degree greater than or equal to 4 will be determined using the double inductions and the method of exchanging colors from the aspect of configuration pro... 详细信息
来源: 评论
The Entire Coloring of series-parallel graphs
收藏 引用
Acta Mathematicae Applicatae Sinica 2005年 第1期21卷 61-66页
作者: Jian-liangWu Yu-liangWu SchoolofMathematics ShandongUniversityJinan250031China DepartmentofComputerScienceandEngineering TheChineseUniversityofHongKongShatinHongKong
The entire chromatic number χ_(vef) (G) of a plane graph G is the minimalnumber of colors needed for coloring vertices, edges and faces of G such that no two adjacent orincident elements are of the same color. Let G ... 详细信息
来源: 评论
Orthogonal drawings of series-parallel graphs with minimum bends
收藏 引用
16th International Symposium on Algorithms and Computations (ISAAC 2005)
作者: Zhou, X Nishizeki, T Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edges do not cross except at their common... 详细信息
来源: 评论