设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(1)
SpringerLink电子期刊(76)
Elsevier电子期刊(13)
在“
Elsevier电子期刊
”中,
命中:
13
条,耗时:小于0.01 秒
在所有数据库中总计命中:
90
条
1.
Colouring of graphs with Ramsey-type forbidden subgraphs
作者:
Konrad K. Dabrowski
;
Petr
A.
Golovach
;
Daniel Paulusma
关键词:
Colouring
;
Independent set
;
Clique
;
Forbidden induced subgraphs
刊名:Theoretical Computer Science
出版年:20 February, 2014
2.
List coloring in the absence of two subgraphs
作者:
Petr
A.
Golovach
;
Dani毛l Paulusma
关键词:
List coloring
;
Forbidden induced subgraph
;
Computational complexity
刊名:Discrete Applied Mathematics
出版年:31 March, 2014
3.
Parameterized complexity of connected even/odd subgraph problems
作者:
Fedor V. Fomin
;
Petr
A.
Golovach
关键词:
Parameterized complexity
;
Euler graph
;
Even graph
;
Odd graph
;
Treewidth
刊名:Journal of Computer and System Sciences
出版年:2014
4.
Lift-contractions
作者:
Petr
A.
Golovach
;
Dani?l Paulusma
;
Marcin Kami¨½ski
;
Dimitrios M. Thilikos
刊名:European Journal of Combinatorics
出版年:2014
5.
4-coloring -free graphs when is small
作者:
Petr
A.
Golovach
;
Dani?l Paulusma
;
Jian Song
关键词:
Graph coloring
;
Forbidden induced subgraph
;
Linear forest
;
Polynomial-time algorithm
刊名:Discrete Applied Mathematics
出版年:2013
6.
Determining the chromatic number of triangle-free -free graphs in polynomial time
作者:
Hajo Broersma
hajo.broersma@durham.ac.uk
;
Petr
A.
Golovach
petr
.
golovach
@durham.ac.uk
;
Danië
;
l Paulusma
;
daniel.paulusma@durham.ac.uk
;
Jian Song
jian.song@durham.ac.uk
关键词:
Chromatic number
;
Triangle-free
;
Forbidden induced subgraph
刊名:Theoretical Computer Science
出版年:2012
7.
Computing vertex-surjective homomorphisms to partially reflexive trees
作者:
Petr
A.
Golovach
;
Dani?l Paulusma
;
Jian Song
关键词:
Graph homomorphism
;
Surjectivity
;
Computational complexity
刊名:Theoretical Computer Science
出版年:2012
8.
Spanners of bounded degree graphs
作者:
Fedor V. Fomin
;
Petr
A.
Golovach
;
Erik Jan van Leeuwen
关键词:
Graph algorithms
;
Graph spanners
;
Fixed-parameter tractability
;
NP-hardness
刊名:Information Processing Letters
出版年:2011
9.
Pursuing a fast robber on a graph
作者:
Fedor V. Fomin
;
Petr
A.
Golovach
;
Jan Kratochví
l ;
Nicolas Nisse
;
Karol Suchan
关键词:
Pursuit-evasion game on graphs
;
Cops and Robbers
;
Complexity
;
Parameterized complexity
;
Cliquewidth
;
Planar graph
刊名:Theoretical Computer Science
出版年:2010
10.
Parameterized algorithm for eternal vertex cover
作者:
Fedor V. Fomin
;
Serge Gaspers
;
Petr
A.
Golovach
;
Dieter Kratsch
;
Saket Saurabh
关键词:
Graph algorithms
;
Parameterized complexity
;
Fixed parameter tractability
;
Vertex cover
;
Eternal vertex cover
刊名:Information Processing Letters
出版年:2010
1
2
按检索点细分(13)
作者(13)
按出版年细分(13)
2027年及以后(1)
2014年(2)
2013年(1)
2012年(2)
2011年(1)
2010年(3)
2009年(1)
2003年(1)
2000年及以前(1)
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
.