๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An operator approach to some graph enumeration problems

โœ Scribed by C.J. Liu; Yutze Chow


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
275 KB
Volume
44
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Deferred-query: An efficient approach fo
โœ Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 99 KB ๐Ÿ‘ 2 views

This paper introduces the idea of a deferred-query approach to design O(n) algorithms for the domatic partition, optimal path cover, Hamiltonian path, Hamiltonian circuit, and maximum matching problems on interval graphs given n endpoint-sorted intervals. The previous best-known algorithms run in O(

Spectral approach to homogenization of a
โœ R. Bunoiu; G. Cardone; T. Suslina ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 334 KB

## The operator A e = D 1 g 1 (x 1 / e,x 2 )D 1 +D 2 g 2 (x 1 / e,x 2 )D 2 is considered in L 2 (R 2 ), where g j (x 1 ,x 2 ), j = 1, 2, are periodic in x 1 with period 1, bounded and positive definite. Let function Q(x 1 ,x 2 ) be bounded, positive definite and periodic in x 1 with period 1. Let