The average size of ordered binary subgraphs
Hartel, P. H. (1988) The average size of ordered binary subgraphs. Graph-theoretic concepts in computer science, WG 88, LNCS 344 Springer-Verlag, Berlin, 327-351.
Download
Full text not available from this repository.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Address: Amsterdam, The Netherlands |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science |
| Item ID: | 253130 |
| Date Deposited: | 03 May 2000 |
| Last Modified: | 02 Mar 2012 12:58 |
| Contributors: | Hartel, P. H. (Author) van Leeuwen, J. (Editor) |
| Date: | June 1988 |
| Additional Information: | Address: Amsterdam, The Netherlands |
| Status: | Published |
| Publisher: | Springer-Verlag, Berlin |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/253130 |
Actions (login required)
 |
View Item |
