设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI学位论文(10)
知网期刊论文(5)
在“
Elsevier电子期刊
”中,
命中:
22
条,耗时:小于0.01 秒
在所有数据库中总计命中:
15
条
1.
Characterizing width two for variants of
treewidth
作者:
Hans L. Bodlaender
a
;
b
;
h.l.bodlaender@uu.nl
;
Stefan Kratsch
c
;
kratsch@cs.uni-bonn.de
;
Vincent J.C. Kreuzen
d
;
v.kreuzen@maastrichtuniversity.nl
;
O-joung Kwon
e
;
ojoung@kaist.ac.kr
;
Seongmin Ok
f
;
seok@dtu.dk
关键词:
Treewidth
;
Special
treewidth
;
Spaghetti
treewidth
;
Strongly chordal
treewidth
;
Minor
刊名:Discrete Applied Mathematics
出版年:2017
2.
Directed
width parameters and circumference of digraphs
作者:
Shiva Kintali
kintali@cs.princeton.edu
关键词:
Arboreal decomposition
;
Directed
treewidth
;
DAG-decomposition
;
DAG-width
;
Kelly decomposition
;
Kelly-width
刊名:Theoretical Computer Science
出版年:2017
3.
Forbidden
directed
minors and Kelly-width
作者:
Shiva Kintali
a
;
kintali@cs.princeton.edu
;
Qiuyi Zhang
b
;
qiuyiz@princeton.edu
关键词:
Forbidden minors
;
Graph minors
;
Kelly-width
;
Partial k-DAGs
;
Treewidth
刊名:Theoretical Computer Science
出版年:2017
4.
An algorithmic metatheorem for
directed
treewidth
作者:
Mateus de Oliveira Oliveira
mateus.oliveira@math.cas.cz" class="auth_mail" title="E-mail the corresponding author
关键词:
Combinatorial slice theory
;
Directed
treewidth
;
Tree-zig-zag number
;
Monadic second order logic of graphs
;
Algorithmic metatheorems
刊名:Discrete Applied Mathematics
出版年:2016
5.
On the Shortest Path Game
作者:
Andreas Darmann
a
;
andreas.darmann@uni-graz.at
;
Ulrich Pferschy
b
;
pferschy@uni-graz.at
;
Joachim Schauer
b
;
joachim.schauer@uni-graz.at
关键词:
Shortest path problem
;
Game theory
;
Computational complexity
;
Cactus graph
刊名:Discrete Applied Mathematics
出版年:2017
6.
Are there any good digraph width measures?
作者:
Robert Ganian
c
;
rganian@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Petr Hliněný
;
b
;
hlineny@fi.muni.cz" class="auth_mail" title="E-mail the corresponding author
;
Joachim Kneis
a
;
kneis@cs.rwth-aachen.de" class="auth_mail" title="E-mail the corresponding author
;
Daniel Meister
a
;
daniel.meister@uni-trier.de" class="auth_mail" title="E-mail the corresponding author
;
Jan Obdržá
;
lek
b
;
obdrzalek@fi.muni.cz" class="auth_mail" title="E-mail the corresponding author
;
Peter Rossmanith
a
;
rossmani@cs.rwth-aachen.de" class="auth_mail" title="E-mail the corresponding author
;
Somnath Sikdar
a
;
sikdar@cs.rwth-aachen.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Tree-width
;
Digraph width
;
Directed
minor
;
Cops-and-robber game
刊名:Journal of Combinatorial Theory, Series B
出版年:2016
7.
Polynomial-time algorithms for special cases of the maximum confluent flow problem
作者:
Daniel Dressler
;
Martin Strehler
关键词:
Confluent flow
;
Outerplanar graph
;
Polynomial-time algorithm
;
Treewidth
;
FPTAS
刊名:Discrete Applied Mathematics
出版年:30 January, 2014
8.
Polynomial-time algorithms for special cases of the maximum confluent flow problem
作者:
Daniel Dressler
;
Martin Strehler
关键词:
Confluent flow
;
Outerplanar graph
;
Polynomial-time algorithm
;
Treewidth
;
FPTAS
刊名:Discrete Applied Mathematics
出版年:30 January, 2014
9.
Entanglement and the complexity of
directed
graphs
作者:
Dietmar Berwanger
a
;
dwb@lsv.ens-cachan.fr
;
Erich Grä
;
del
b
;
graedel@logic.rwth-aachen.de
;
?ukasz Kaiser
c
;
kaiser@liafa.univ-paris-diderot.fr
;
Roman Rabinovich
b
;
rabinovich@logic.rwth-aachen.de
关键词:
Structural graph theory
;
Graph searching games
;
Parity games
;
Digraph algorithms
刊名:Theoretical Computer Science
出版年:2012
10.
Parameterized maximum path coloring
作者:
Michael Lampis
关键词:
Path coloring
;
EPT graphs
;
Parameterized complexity
刊名:Theoretical Computer Science
出版年:4 November, 2013
1
2
3
按检索点细分(22)
题名(1)
关键词(2)
文摘(19)
按出版年细分(22)
2027年及以后(3)
2017年(4)
2016年(2)
2012年(2)
2011年(3)
2010年(1)
2008年(1)
2007年(1)
2003年(1)
2002年(1)
2000年(1)
2000年及以前(2)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.