咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
ON THE SUM OF POWERS OF THE DEGREES OF graphS
收藏 引用
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY 2013年 第3期88卷 353-358页
作者: Xu, Renyu Wu, Jianliang Wang, Guanghui Zhang, Xin Shandong Univ Sch Math Jinan 250100 Peoples R China Xidian Univ Dept Math Xian 710071 Peoples R China
For positive integers p and q, let G(p,q) be a class of graphs such that vertical bar E(G)vertical bar = 2p. We obtain an upper bound for this sum that is linear in Delta(k-1). These graphs include the planar, 1-plana... 详细信息
来源: 评论
On the Rainbow Connectivity of graphs: Complexity and FPT Algorithms
收藏 引用
ALGORITHMICA 2013年 第2期67卷 161-179页
作者: Uchizawa, Kei Aoki, Takanori Ito, Takehiro Suzuki, Akira Zhou, Xiao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
For a graph G=(V,E) and a color set C, let f:E -> C be an edge-coloring of G in which two adjacent edges may have the same color. Then, the graph G edge-colored by f is rainbow connected if every two vertices of G ... 详细信息
来源: 评论
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2008年 第8期35卷 2684-2693页
作者: Wang, Ji-Bo Ng, C. T. Cheng, T. C. E. Shenyang Inst Aeronaut Engn Dept Sci Shenyang 110136 Peoples R China Hong Kong Polytech Univ Dept Logist Kowloon Hong Kong Peoples R China
This paper considers single-machine scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting times. In addition, the jobs are related by a series-para... 详细信息
来源: 评论
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
收藏 引用
NETWORKS 2012年 第2期60卷 103-119页
作者: Shen, Siqian Smith, J. Cole Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA
We examine variants of the critical node problem on specially structured graphs, which aim to identify a subset of nodes whose removal will maximally disconnect the graph. These problems lie at the intersection of net... 详细信息
来源: 评论
On the Maximum Number of Cycles in Outerplanar and series-parallel graphs
收藏 引用
graphS AND COMBINATORICS 2012年 第2期28卷 265-275页
作者: de Mier, Anna Noy, Marc Univ Politecn Cataluna Dept Matemat Aplicada 2 ES-08034 Barcelona Spain
Let c(n) be themaximum number of cycles in an outerplanar graph with n vertices. We show that lim c(n)(1/n) exists and equals beta = 1.502837 ..., where beta is a constant related to the recurrence x(n+1) = 1 + x(n)(2... 详细信息
来源: 评论
Exact counting of Euler tours for generalized series-parallel graphs
收藏 引用
JOURNAL OF DISCRETE ALGORITHMS 2012年 第1期10卷 110-122页
作者: Chebolu, Prasad Cryan, Mary Martin, Russell Univ Liverpool Dept Comp Sci Ashton Bldg Liverpool L69 3BX Merseyside England Univ Edinburgh Sch Informat Lab Fdn Comp Sci Edinburgh EH8 9AB Midlothian Scotland
We give a simple polynomial-time algorithm to exactly count the number of Euler tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the ... 详细信息
来源: 评论
On r-acyclic edge colorings of planar graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2012年 第13-14期160卷 2048-2053页
作者: Zhang, Xin Wang, Guanghui Yu, Yong Li, Jinbo Liu, Guizhen Shandong Univ Sch Math Jinan 250100 Peoples R China Xidian Univ Dept Math Xian 710071 Peoples R China China Univ Min & Technol Coll Sci Xuzhou 221116 Peoples R China
A proper edge coloring of G is r-acyclic if every cycle C contained in G is colored with at least min{vertical bar C vertical bar, r} colors. The r-acyclic chromatic index of a graph, denoted by a(r)'(G), is the m... 详细信息
来源: 评论
Maximum series-parallel Subgraph
收藏 引用
ALGORITHMICA 2012年 第1-2期63卷 137-157页
作者: Calinescu, Gruia Fernandes, Cristina G. Kaul, Hemanshu Zelikovsky, Alexander IIT Dept Comp Sci Chicago IL 60616 USA Univ Sao Paulo Dept Comp Sci BR-05508090 Sao Paulo Brazil IIT Dept Appl Math Chicago IL 60616 USA Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA
Consider the NP-hard problem of, given a simple graph G, to find a series-parallel subgraph of G with the maximum number of edges. The algorithm that, given a connected graph G, outputs a spanning tree of G, is a 1/2-... 详细信息
来源: 评论
Small grid drawings of planar graphs with balanced partition
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2012年 第2期24卷 99-115页
作者: Zhou, Xiao Hikino, Takashi Nishizeki, Takao Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan Kwansei Gakuin Univ Fac Sci & Technol Sanda 6691337 Japan
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line segment without any edge-intersection. It is known that every planar graph G of n vertices has a... 详细信息
来源: 评论
Minimum Spanning Tree Problem with Label Selection
收藏 引用
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年 第2期E94D卷 233-239页
作者: Fujiyoshi, Akio Suzuki, Masakazu Ibaraki Univ Dept Comp & Informat Sci Hitachi Ibaraki 3168511 Japan Kyushu Univ Grad Sch Math Fukuoka 8190395 Japan
In this paper, we study the minimum spanning tree problem with label selection, that is, the problem of finding a minimum spanning tree of a vertex-labeled graph where the weight of each edge may vary depending on the... 详细信息
来源: 评论