设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(432)
Elsevier电子期刊(1)
在“
SpringerLink电子期刊
”中，
命中：
432
条，耗时：0.0649692 秒
在所有数据库中总计命中：
433
条
1.
Well Quasi Orders in Subclasses of Bounded Treewidth
Graph
s and Their Algorithmic Applications
作者：
Michael R. Fellows (1) michael.fellows@cdu.edu.au
Danny Hermelin (2) hermelin@mpi-inf.mpg.de
Frances A. Rosamond (1) frances.rosamond@cdu.edu.au
关键词：
Well quasi order &#
8211
;
Treewidth &#
8211
;
Tree decomposition &#
8211
;
Bounded vertex cover
graph
s &#
8211
;
Bounded feedback vertex set
graph
s &#
8211
;
Bounded circumference
graph
s &#
8211
;
Parameterized complexity &#
8211
;
Exact
algorithms
&#
8211
;
Meta
;
algorithms
&#
8211
;
Geometric
graph
recognition &#
8211
;
String
graph
s
刊名：Algorithmica
出版年：2012
2.
Calculating
Graph
Algorithms
for Dominance and Shortest Path
作者：
Ilya Sergey (1) Ilya.Sergey@cs.kuleuven.be
Jan Midtgaard (2) jmi@cs.au.dk
Dave Clarke (1) Dave.Clarke@cs.kuleuven.be
关键词：
graph
algorithms
&#
8211
;
dominance &#
8211
;
shortest path algorithm &#
8211
;
fixed
;
point fusion &#
8211
;
fixed
;
point calculus &#
8211
;
Galois connections
刊名：Lecture Notes in Computer Science
出版年：2012
3.
LP and SDP branch-and-cut
algorithms
for the minimum
graph
bisection problem: a computational comparison
作者：
Michael Armbruster (1)
Marzena F眉genschuh (2) fuegenschuh@beuth-hochschule.de
Christoph Helmberg (1) helmberg@mathematik.tu-chemnitz.de
Alexander Martin (3) alexander.martin@math.uni-erlangen.de
关键词：
Branch and cut
algorithms
&#
8211
;
Cutting plane
algorithms
&#
8211
;
Polyhedral combinatorics &#
8211
;
Semidefinite programs &#
8211
;
Graph
bisection
刊名：Mathematical Programming Computation
出版年：2012
4.
Computing Strong Articulation Points and Strong Bridges in Large Scale
Graph
s
作者：
Donatella Firmani (1) firmani@dis.uniroma1.it
Giuseppe F. Italiano (2) italiano@disp.uniroma2.it
Luigi Laura (1) laura@dis.uniroma1.it
Alessio Orlandi (3) aorlandi@di.unipi.it
Federico Santaroni (2) santaroni@disp.uniroma2.it
关键词：
graph
algorithms
&#
8211
;
strong connectivity &#
8211
;
strong articulation points &#
8211
;
strong bridges &#
8211
;
large scale
graph
s
刊名：Lecture Notes in Computer Science
出版年：2012
5.
Algorithms
for the Strong Chromatic Index of Halin
Graph
s, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
作者：
Ton Kloks (1) kloks@cs.nthu.edu.tw
Sheung-Hung Poon (1) spoon@cs.nthu.edu.tw
Chin-Ting Ung (1)
Yue-Li Wang (2) ylwang@cs.ntust.edu.tw
关键词：
Strong chromatic index &#
8211
;
Halin
graph
s &#
8211
;
Distance
;
hereditary
graph
s &#
8211
;
Outerplanar
graph
s
刊名：Lecture Notes in Computer Science
出版年：2012
6.
FPT
algorithms
for Connected Feedback Vertex Set
作者：
Neeldhara Misra (1) neeldhara@imsc.res.in
Geevarghese Philip (1) gphilip@imsc.res.in
Venkatesh Raman (1) vraman@imsc.res.in
Saket Saurabh (1) saket@imsc.res.in
Somnath Sikdar (2) sikdar@cs.rwth-aachen.de
关键词：
Parameterized
algorithms
&#
8211
;
FPT
algorithms
&#
8211
;
Connected Feedback Vertex Set &#
8211
;
Feedback Vertex Set &#
8211
;
Group Steiner Tree &#
8211
;
Steiner Tree &#
8211
;
Directed Steiner Out
;
Tree &#
8211
;
Hardness of polynomial kernelization &#
8211
;
Subexponential FPT
algorithms
&#
8211
;
H
;
minor
;
free
graph
s &#
8211
;
Dynamic programming over tree decompositions
刊名：Journal of Combinatorial Optimization
出版年：2012
7.
Efficient distributed approximation
algorithms
via probabilistic tree embeddings
作者：
Maleq Khan (1) maleq@vbi.vt.edu
Fabian Kuhn (2) fabian.kuhn@usi.ch
Dahlia Malkhi (3) dalia@microsoft.com
Gopal Pandurangan (4) gopalpandurangan@gmail.com
Kunal Talwar (3) kunal@microsoft.com
关键词：
Generalized steiner forests &#
8211
;
Shortest paths &#
8211
;
Optimum routing cost spanning trees &#
8211
;
Least element lists &#
8211
;
Metric spaces &#
8211
;
Leader election &#
8211
;
Probabilistic tree embeddings
刊名：Distributed Computing
出版年：2012
8.
Algorithms
for Bandwidth Consecutive Multicolorings of
Graph
s
作者：
Kazuhide Nishikawa (1) nishikawa@kwansei.ac.jp
Takao Nishizeki (1) nishi@kwansei.ac.jp
Xiao Zhou (2) zhou@ecei.tohoku.ac.jp
关键词：
Bandwidth coloring &#
8211
;
Channel assignment &#
8211
;
Multicoloring &#
8211
;
Series
;
parallel
graph
&#
8211
;
Partial k
;
tree &#
8211
;
Algorithm &#
8211
;
Acyclic orientation &#
8211
;
Approximation &#
8211
;
FPTAS
刊名：Lecture Notes in Computer Science
出版年：2012
9.
Evaluating
Graph
Traversal
Algorithms
for Distributed SPARQL Query Optimization
作者：
Xin Wang (1) xw4g08@ecs.soton.ac.uk
Thanassis Tiropanis (1) tt2@ecs.soton.ac.uk
Hugh C. Davis (1) hcd@ecs.soton.ac.uk
关键词：
SPARQL &#
8211
;
Linked Date &#
8211
;
distributed query processing &#
8211
;
graph
theory
刊名：Lecture Notes in Computer Science
出版年：2012
10.
Learning
graph
ical models for relational data via lattice search
作者：
Oliver Schulte (1) oschulte@cs.sfu.ca
Hassan Khosravi (1) hkhosrav@cs.sfu.ca
关键词：
Statistical
;
relational learning &#
8211
;
Graph
ical models &#
8211
;
Markov logic networks &#
8211
;
Bayes nets
刊名：Machine Learning
出版年：2012
1
2
3
4
5
6
7
8
9
按检索点细分(432)
关键词(31)
文摘(192)
按出版年细分(432)
2012年(143)
2011年(46)
2010年(27)
2009年(30)
2008年(36)
2007年(30)
2006年(42)
2005年(26)
2004年(7)
2003年(6)
2002年(15)
2001年(7)
2000年(6)
2000年及以前(11)
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
.
