Skip to main content

Publisher: Elsevier

Volume 62, Number 6, 27 June 1997

An O(n) time algorithm for maximum matching in P4-tidy graphs
pp. 281-287(7)
Authors: Angirasa, D.; Peterson, G.P.; Fouquet, J.L.; Parfenoff, I.; Thuillier, H.

Favourites:
ADD

On some factorizations of infinite words by elements of codes
pp. 289-294(6)
Authors: Pitsillos, J.S.; Yeow, Y.L.; Gray, N.B.; Justin, J.; Pirillo, G.

Favourites:
ADD

A note on optical routing on trees
pp. 295-300(6)
Authors: Brusstar, M.J.; Merte, H.; Kumar, S.R.; Panigrahy, R.; Russell, A.; Sundaram, R.

Favourites:
ADD

An improved lower bound for load balancing of tasks with unknown duration
pp. 301-303(3)
Authors: Mitrovic, J.; Ma, Y.; Plotkin, S.

Favourites:
ADD

Systematic debugging method for attribute grammar description
pp. 305-313(9)
Authors: Tan, Z.; Yang, W.; Sassa, M.; Ookubo, T.

Favourites:
ADD

A linear-time algorithm for four-partitioning four-connected planar graphs
pp. 315-322(8)
Authors: Nakano, S.; Rahman, M.S.; Nishizeki, T.

Favourites:
ADD

A parallel algorithm for solving the coloring problem on trapezoid graphs
pp. 323-327(5)
Authors: Ribeiro, F.S.; Mendes, P.R.S.; Braga, S.L.; Nakayama S.-i.; Masuyama, S.

Favourites:
ADD

An old sub-quadratic algorithm for finding extremal sets
pp. 329-334(6)
Authors: Weigand, B.; Ferguson, J.R.; Crawford, M.E.; Pritchard, P.

Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more