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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
91
Voted
NETWORKS
1998
49
views
Computer Networks
»
more
NETWORKS 1998
»
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
15 years 2 months ago
Download
www.cs.kent.edu
Andreas Brandstädt, Feodor F. Dragan
Real-time Traffic
Computer Networks
|
NETWORKS 1998
|
claim paper
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1998
Where
NETWORKS
Authors
Andreas Brandstädt, Feodor F. Dragan
Comments
(0)
Researcher Info
Computer Networks Study Group
Computer Vision