Graph-theoretic concepts in computer science
by Van Bang Le, Andreas Brandstädt
No club is reading this yet — be the first to start one
Author: Andreas Brandstädt, Van Bang Le
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42707-0
DOI: 10.1007/3-540-45477-2
Table of Contents:
- Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
- Data Management in Networks
- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
- Approximate Constrained Bipartite Edge Coloring
- Maximum Clique Transversals
- On the Tree-Degree of Graphs
- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
- (k+) -Disatance- Herediatry Graphs
- On the Relationship between Clique-Width and Treewidth
- Planarity of the 2-Level Cactus Model
- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
- (g, f)-Factorizations Orthogonal to k Subgraphs
- On Star Coloring of Graphs
- Graph Subcolorings: Complexity and Algorithms
- Approximation of Pathwidth of Outerplanar Graphs
- On the Monotonicity of Games Generated by Symmetric Submodular Functions
- Multiple Hotlink Assignment
- Small k-Dominating Sets in Planar Graphs with Applications
- Lower Bounds for Algorithms for the Steiner Tree Problem
Discuss Graph-theoretic concepts in computer science with other readers
Join or start a book club for Graph-theoretic concepts in computer science on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Graph-theoretic concepts in computer science?
Sign up free on Readfeed, then browse public clubs or start your own club with Graph-theoretic concepts in computer science as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Graph-theoretic concepts in computer science with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Graph-theoretic concepts in computer science with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.