Sciweavers

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

3

CORR
2007
Springer

favoriteEmaildiscussreport

109views Education» more CORR 2007»

Algorithms for Generating Convex Sets in Acyclic Digraphs

13 years 4 months ago

Algorithms for Generating Convex Sets in Acyclic Digraphs

Download www.cs.rhul.ac.uk

Paul N. Balister, Stefanie Gerke, Gregory Gutin, A

Real-time Traffic

CORR 2007 | Education |

claim paper

Related Content

» Generating connected acyclic digraphs uniformly at random

» The size distribution for Markov equivalence classes of acyclic digraph models

» On the Directed DegreePreserving Spanning Tree Problem

» A Functional Hitchhikers Guide to Hereditarily Finite Sets Ackermann Encodings and Pairing...

» Executable Set Theory and Arithmetic Encodings in Prolog

» A Convexity Lemma and Expansion Procedures for Bipartite Graphs

» Generating Paths and Cuts in Multipole Digraphs

» Kernels for Feedback Arc Set In Tournaments

» Extracting a largest redundancyfree XML storage structure from an acyclic hypergraph in po...

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, A. Soleimanfallah, Anders Yeo

Comments (0)