Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
14
click to vote
WG
2009
Springer
favorite
Email
discuss
report
90
views
Theoretical Computer Science
»
more
WG 2009
»
Maximum Series-Parallel Subgraph
13 years 9 months ago
Download
www.lirmm.fr
Gruia Calinescu, Cristina G. Fernandes, Hemanshu K
Real-time Traffic
WG 2009
|
claim paper
Related Content
»
CP Models for Maximum Common Subgraph Problems
»
Total 4Choosability of SeriesParallel Graphs
»
Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends
»
On the Advantage over Random for Maximum Acyclic Subgraph
»
Subexponential parameterized algorithms for degreeconstrained subgraph problems on planar ...
»
Online Structural Graph Clustering Using Frequent Subgraph Mining
»
Maximum common subgraph some upper bound and lower bound results
»
Generalized Subgraph Preconditioners for LargeScale Bundle Adjustment
»
MaximumSize Subgraphs of P4Sparse Graphs Admitting a Perfect Matching
more »
Post Info
More Details (n/a)
Added
27 Jul 2010
Updated
27 Jul 2010
Type
Conference
Year
2009
Where
WG
Authors
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision