𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique structure in school class data

✍ Scribed by Ingegerd Jansson

Book ID
108455564
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
739 KB
Volume
19
Category
Article
ISSN
0378-8733

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The max clique problem in classes of str
The max clique problem in classes of string-graphs
✍ M. Middendorf; F. Pfeiffer πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 378 KB

Middendorf, M., F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete Mathematics 108 (1992) 365-372. A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NPcomp

CLASSES IN DUBLIN SCHOOLS
CLASSES IN DUBLIN SCHOOLS
✍ Hayden, G.T. πŸ“‚ Article πŸ“… 1837 πŸ› The Lancet 🌐 English βš– 237 KB
r-Dominating cliques in graphs with hype
r-Dominating cliques in graphs with hypertree structure
✍ Feodor F. Dragan; Andreas BrandstΓ€dt πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 848 KB

Let G = (V, E) be an undirected graph and r be a vertex weight function with positive integer values. A subset (clique) D ~\_ V is an r-dominating set (clique) in G ifffor every vertex v e V there is a vertex u e D with dist(u, v) <~ r(v). This paper contains the following results: (i) We give a si