Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

56

Voted

CPC
2004

favoriteEmaildiscussreport

68views more CPC 2004»

Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs

14 years 9 months ago

Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs

Download www.dur.ac.uk

Magnus Bordewich

Real-time Traffic

CPC 2004 |

claim paper

Related Content

» Approximating Acyclicity Parameters of Sparse Hypergraphs

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

» SpaceEfficient Algorithms for Reachability in SurfaceEmbedded Graphs

» Minimum number of wavelengths equals load in a DAG without internal cycle

» Local Graph Partitions for Approximation and Testing

» The dynamics of message passing on dense graphs with applications to compressed sensing

» An optimal polygonal boundary encoding scheme in the rate distortion sense

» A General Approach to Model Biomedical Data from 3D Unorganised Point Clouds with Medial S...

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CPC
Authors	Magnus Bordewich

Comments (0)