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
20
click to vote
COCOON
2005
Springer
favorite
Email
discuss
report
88
views
Combinatorics
»
more
COCOON 2005
»
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
14 years 2 months ago
Download
www.iis.sinica.edu.tw
Wen-Lian Hsu
Real-time Traffic
COCOON 2005
|
claim paper
Related Content
»
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
»
A Simple LinearTime Recognition Algorithm for Weakly QuasiThreshold Graphs
»
An SPQRTree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
»
Maximum kChains in Planar Point Sets Combinatorial Structure and Algorithms
»
A Simple Test for the Consecutive Ones Property
»
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theo...
»
The Refined Process Structure Tree
»
Towards Graph Containment Search and Indexing
»
A Complexity View of Markets with Social Influence
more »
Post Info
More Details (n/a)
Added
26 Jun 2010
Updated
26 Jun 2010
Type
Conference
Year
2005
Where
COCOON
Authors
Wen-Lian Hsu
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision