Graph-Theoretic Concepts in Computer Science计算机科学中的图论概念 mobi pdf azw3 夸克云 pdb 115盘 lrf 下载

Graph-Theoretic Concepts in Computer Science计算机科学中的图论概念精美图片
》Graph-Theoretic Concepts in Computer Science计算机科学中的图论概念电子书籍版权问题 请点击这里查看《

Graph-Theoretic Concepts in Computer Science计算机科学中的图论概念书籍详细信息

  • ISBN:9783540241324
  • 作者:暂无作者
  • 出版社:暂无出版社
  • 出版时间:2005-02
  • 页数:404
  • 价格:556.90
  • 纸张:胶版纸
  • 装帧:平装
  • 开本:暂无开本
  • 语言:未知
  • 丛书:暂无丛书
  • TAG:暂无
  • 豆瓣评分:暂无豆瓣评分
  • 豆瓣短评:点击查看
  • 豆瓣讨论:点击查看
  • 豆瓣目录:点击查看
  • 读书笔记:点击查看
  • 原文摘录:点击查看

内容简介:

This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004.

The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and exponential algorithms; counting, combinatorics, and optimization; applications in bioinformatics and graph drawing; and graph classes and NP-hard problems.


书籍目录:

Invited Papers

Lexicographic Breadth First Search - A Survey

Wireless Networking: Graph Theory Unplugged

Graph Algorithms: Trees

Constant Time Generation of Trees with Specified Diameter

Treelike Comparability Graphs:Characterization, Recognition, and Applications

Elegant Distance Constrained Labelings of Trees

Collective Tree Spanners and Routing in AT-free Related Graphs

Graph Algorithms: Recognition and Decomposition

On the Maximum Cardinality Search Lower Bound for Treewidth

Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs

Recognizing HHD-free and Welsh-Powell Opposition Graphs

Bimodular Decomposition of Bipartite Graphs

Coloring a Graph Using Split Decomposition

Graph Algorithms: Various Problems

Decremental Clique Problem

A Symbolic Approach to the All-Pairs Shortest-Paths Problem

Minimal de Bruijn Sequence in a Language with Forbidden Substrings

A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic CL

Optimization and Approximation Algorithms

The Computational Complexity of the Mininmum Weight Processor Assignment Problem

A Stochastic Location Problem with Applications to Tele-diagnostic

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

Tolerance Based Algorithms for the ATSP

Parameterized Complexity and Exponential Algorithms

Finding k Disjoint Triangles in an Arbitrary Graph

Exact (Exponential) Algorithms for the Dominating Set Problem

Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps

Counting, Combinatorics, and Optimization

Planar Graphs, via Well-Orderly Maps and Trees

……

Applications (Biology,Graph Drawing)

Graph Classes and NP Hardness

Author Index


作者介绍:

暂无相关内容,正在全力查找中


出版社信息:

暂无出版社相关信息,正在全力查找中!


书籍摘录:

暂无相关书籍摘录,正在全力查找中!



原文赏析:

暂无原文赏析,正在全力查找中!


其它内容:

暂无其它内容!


书籍真实打分

  • 故事情节:8分

  • 人物塑造:6分

  • 主题深度:8分

  • 文字风格:8分

  • 语言运用:3分

  • 文笔流畅:9分

  • 思想传递:3分

  • 知识深度:7分

  • 知识广度:5分

  • 实用性:5分

  • 章节划分:8分

  • 结构布局:5分

  • 新颖与独特:9分

  • 情感共鸣:6分

  • 引人入胜:8分

  • 现实相关:6分

  • 沉浸感:3分

  • 事实准确性:3分

  • 文化贡献:4分


网站评分

  • 书籍多样性:6分

  • 书籍信息完全性:5分

  • 网站更新速度:4分

  • 使用便利性:9分

  • 书籍清晰度:9分

  • 书籍格式兼容性:3分

  • 是否包含广告:7分

  • 加载速度:9分

  • 安全性:3分

  • 稳定性:3分

  • 搜索功能:6分

  • 下载便捷性:7分


下载点评

  • 差评(259+)
  • 图书多(459+)
  • 购买多(236+)
  • 章节完整(452+)
  • 差评少(493+)
  • 三星好评(219+)
  • 藏书馆(475+)
  • 少量广告(192+)
  • 无盗版(381+)
  • 下载速度快(680+)

下载评价

  • 网友 谢***灵:

    推荐,啥格式都有

  • 网友 寇***音:

    好,真的挺使用的!

  • 网友 龚***湄:

    差评,居然要收费!!!

  • 网友 师***怡:

    说的好不如用的好,真心很好。越来越完美

  • 网友 石***烟:

    还可以吧,毕竟也是要成本的,付费应该的,更何况下载速度还挺快的

  • 网友 冉***兮:

    如果满分一百分,我愿意给你99分,剩下一分怕你骄傲

  • 网友 印***文:

    我很喜欢这种风格样式。

  • 网友 冯***卉:

    听说内置一千多万的书籍,不知道真假的

  • 网友 苍***如:

    什么格式都有的呀。

  • 网友 习***蓉:

    品相完美

  • 网友 仰***兰:

    喜欢!很棒!!超级推荐!

  • 网友 通***蕊:

    五颗星、五颗星,大赞还觉得不错!~~


随机推荐