| Tractable connected domination for restricted bipartite graphs (extended abstract) | |
| Lu, Zhao ; Liu, Tian ; Xu, Ke | |
| 2013 | |
| 英文摘要 | Finding a minimum connected dominating set (connected domination) is known-complete for chordal bipartite graphs, but tractable for convex bipartite graphs. In this paper, connected domination is shown tractable for circular-and triad-convex bipartite graphs, by efficient reductions from these graphs to convex bipartite graphs. ? 2013 Springer-Verlag Berlin Heidelberg.; EI; 0 |
| 语种 | 英语 |
| DOI标识 | 10.1007/978-3-642-38768-5_65 |
| 内容类型 | 其他 |
| 源URL | [http://ir.pku.edu.cn/handle/20.500.11897/411708]  |
| 专题 | 信息科学技术学院 |
| 推荐引用方式 GB/T 7714 | Lu, Zhao,Liu, Tian,Xu, Ke. Tractable connected domination for restricted bipartite graphs (extended abstract). 2013-01-01. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论