The University of Southampton
University of Southampton Institutional Repository

The average size of ordered binary subgraphs

The average size of ordered binary subgraphs
The average size of ordered binary subgraphs
327-351
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
van Leeuwen, J.
768085d5-ced1-495e-a5ca-5f8a3bda7888
Hartel, P. H.
debf0597-4832-4eb3-8243-177b5a3c44cf
van Leeuwen, J.
768085d5-ced1-495e-a5ca-5f8a3bda7888

Hartel, P. H. (1988) The average size of ordered binary subgraphs. van Leeuwen, J. (ed.) Graph-theoretic concepts in computer science, WG 88, LNCS 344. pp. 327-351 .

Record type: Conference or Workshop Item (Other)

Full text not available from this repository.

More information

Published date: June 1988
Additional Information: Address: Amsterdam, The Netherlands
Venue - Dates: Graph-theoretic concepts in computer science, WG 88, LNCS 344, 1988-06-01
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 253130
URI: https://eprints.soton.ac.uk/id/eprint/253130
PURE UUID: d819d171-4021-4f69-b27e-18a02520a385

Catalogue record

Date deposited: 03 May 2000
Last modified: 18 Jul 2017 09:59

Export record

Contributors

Author: P. H. Hartel
Editor: J. van Leeuwen

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×