We consider the problem ofefficiently breaking a graph into small components through the removal of edges. One measure of how easily this can be done is the edge-integrity, defined to be the minimum sum of the number of edges removed and the order of a largest remaining component, taken over all set
โฆ LIBER โฆ
Assessing polygon edge integrity
โ Scribed by Steven A. Roberts; G. Brent Hall; Paul H. Calamai
- Book ID
- 105748055
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- English
- Weight
- 856 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1435-5930
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Edge-integrity: a survey
โ
K.S. Bagga; L.W. Beineke; M.J. Lipman; R.E. Pippert
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 584 KB
Computing visibility polygon from an edg
โ
D.T Lee; A.K Lin
๐
Article
๐
1986
๐
Elsevier Science
โ 93 KB
Shortest path solves edge-to-edge visibi
โ
Godfried T Toussaint
๐
Article
๐
1986
๐
Elsevier Science
๐
English
โ 376 KB
Generalized edge frequency polygon for d
โ
Jianping Dong; Chuang Zheng
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 111 KB
Jones et al. (Biometrica 85, 235) proposed an edge frequency polygon estimator to estimate a probability density function. Their estimator has a smaller asymptotic mean integrated squared error than that of the frequency polygon estimator. In this paper we introduce a generalized edge frequency poly
Equitransitive edge-to-edge tilings by r
โ
I. Debroey; F. Landuyt
๐
Article
๐
1981
๐
Springer
๐
English
โ 618 KB
Hyperbolic Regular Polygons with Notched
โ
Casey Mann
๐
Article
๐
2005
๐
Springer
๐
English
โ 479 KB