Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Frontiers in Algorithmics: Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings > Matching for Graphs of Bounded Degree
Frontiers in Algorithmics: Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings |
Franco P. Preparata; Xiaodong Wu; Jianping Yin
Springer Berlin Heidelberg
Frontiers in Algorithmics: Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings
Matching for Graphs of Bounded Degree
Authors

Yijie Han

ARI Id

1664874781228_3879491

Access

Not Available Free

Pages

171-173

DOI

10.1007/978-3-540-69311-6_19

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-69311-6_19

Table of Contents of Book
Showing 1 to 20 of 37 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Fixed Point Computation and Equilibrium
Xiaotie Deng
1-1
Computer Science in the Information Age
John Hopcroft
2-2
Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making
Milan Sonka
3-3
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
Danny Z. Chen; Chao Wang
4-15
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
Minzhu Xie; Jianxin Wang; Wei Zhou; Jianer Chen
16-27
SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data
Kevin McCormick; Roli Shrivastava; Li Liao
28-34
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance
Shuai Cheng Li; Yen Kaow Ng; Louxin Zhang
35-44
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information
Seung-Ho Kang; In-Seon Jeong; Mun-Ho Choi; Hyeong-Seok Lim
45-54
Estimating Hybrid Frequency Moments of Data Streams
Sumit Ganguly; Mohit Bansal; Shruti Dube
55-66
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
Guoqiang Bai; Henning Fernau
67-78
NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT ≥ k, r-UNLSAT ≥ k )
Tianyan Deng; Daoyun Xu
79-88
Absorbing Random Walks and the NAE2SAT Problem
K. Subramani
89-100
Versioning Tree Structures by Path-Merging
Khaireel A. Mohamed; Tobias Langner; Thomas Ottmann
101-112
A Linear In-situ Algorithm for the Power of Cyclic Permutation
Jinyun Xue; Bo Yang; Zhengkang Zuo
113-123
Multi-bidding Strategy in Sponsored Keyword Auction
Tian-Ming Bu; Xiaotie Deng; Qi Qi
124-134
A CSP-Based Approach for Solving Parity Game
Min Jiang; Changle Zhou; Guoqing Wu; Fan Zhang
135-146
Characterizing and Computing Minimal Cograph Completions
Daniel Lokshtanov; Federico Mancini; Charis Papadopoulos
147-158
Efficient First-Order Model-Checking Using Short Labels
Bruno Courcelle; Cyril Gavoille; Mamadou Moustapha Kanté
159-170
Matching for Graphs of Bounded Degree
Yijie Han
171-173
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 37 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings