語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Graph-theoretic concepts in computer...
~
(1998 :)
Graph-theoretic concepts in computer science38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Graph-theoretic concepts in computer scienceedited by Martin Charles Golumbic ... [et al.].
其他題名:
38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /
其他作者:
Golumbic, Martin Charles.
團體作者:
出版者:
Berlin, Heidelberg :Springer Berlin Heidelberg :2012.
面頁冊數:
xiii, 346 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
標題:
Graph theoryCongresses.Data processing
電子資源:
http://dx.doi.org/10.1007/978-3-642-34611-8
ISBN:
9783642346118 (electronic bk.)
Graph-theoretic concepts in computer science38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /
Graph-theoretic concepts in computer science
38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /[electronic resource] :edited by Martin Charles Golumbic ... [et al.]. - Berlin, Heidelberg :Springer Berlin Heidelberg :2012. - xiii, 346 p. :ill., digital ;24 cm. - Lecture notes in computer science,75510302-9743 ;. - Lecture notes in computer science ;4891..
Account on Intervals -- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance -- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture -- Triangulation and Clique Separator Decomposition of Claw-Free Graphs -- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs -- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs -- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area -- The Duals of Upward Planar Graphs on Cylinders -- On the Minimum Degree Up to Local Complementation: Bounds and Complexity -- Bisections above Tight Lower Bounds -- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications -- Hydras: Directed Hypergraphs and Horn Formulas -- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill -- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs -- Parameterized Domination in Circle Graphs -- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
ISBN: 9783642346118 (electronic bk.)Subjects--Topical Terms:
444844
Graph theory
--Data processing--Congresses.
Dewey Class. No.: 511.5
Graph-theoretic concepts in computer science38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /
LDR
:03313nmm a2200277 a 4500
001
353104
003
DE-He213
005
20121123134252.0
006
m d
007
cr nn 008maaau
008
121218s2012 gw s 0 eng d
020
$a
9783642346118 (electronic bk.)
020
$a
9783642346101 (paper)
035
$a
978-3-642-34611-8
040
$a
GP
$c
GP
041
0
$a
eng
082
0 4
$a
511.5
$2
23
090
$a
QA166
$b
.I61 2012
111
2
$n
(3rd :
$d
1998 :
$c
Amsterdam, Netherlands)
$3
194767
245
1 0
$a
Graph-theoretic concepts in computer science
$h
[electronic resource] :
$b
38th international workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012 : revised selcted papers /
$c
edited by Martin Charles Golumbic ... [et al.].
260
$a
Berlin, Heidelberg :
$b
Springer Berlin Heidelberg :
$b
Imprint: Springer,
$c
2012.
300
$a
xiii, 346 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
7551
505
0
$a
Account on Intervals -- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance -- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture -- Triangulation and Clique Separator Decomposition of Claw-Free Graphs -- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs -- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs -- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area -- The Duals of Upward Planar Graphs on Cylinders -- On the Minimum Degree Up to Local Complementation: Bounds and Complexity -- Bisections above Tight Lower Bounds -- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications -- Hydras: Directed Hypergraphs and Horn Formulas -- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill -- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs -- Parameterized Domination in Circle Graphs -- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.
520
$a
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
650
0
$a
Graph theory
$x
Data processing
$v
Congresses.
$3
444844
650
0
$a
Computer science
$3
252805
650
1 4
$a
Computer Science.
$3
212513
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
274791
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
252959
650
2 4
$a
Algorithm Analysis and Problem Complexity.
$3
273702
650
2 4
$a
Data Structures.
$3
273992
650
2 4
$a
Geometry.
$3
183883
650
2 4
$a
Algorithms.
$3
184661
700
1
$a
Golumbic, Martin Charles.
$3
254168
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Lecture notes in computer science ;
$v
4891.
$3
383229
856
4 0
$u
http://dx.doi.org/10.1007/978-3-642-34611-8
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000077216
電子館藏
1圖書
電子書
EB 2012
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-642-34611-8
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入