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

A generalized greedy routing algorithm for 2-connected graphs

โœ Scribed by Huaming Zhang; Xin He

Book ID
108281673
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
303 KB
Volume
411
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Worst case analysis of a greedy algorith
Worst case analysis of a greedy algorithm for graph thickness
โœ Sinichiro Kawano; Koichi Yamazaki ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio

Revised Greedy algorithm for formation o
Revised Greedy algorithm for formation of a minimal cycle basis of a graph
โœ Kaveh, A. ;Roosta, G. R. ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 356 KB ๐Ÿ‘ 1 views

## SUM MARY An efficient algorithm is developed for the formation of a minimal cycle basis of a graph. This method reduces the number of cycles to be considered as (candidates for being the elements of a minimal basis and makes practical use of the Greedy algorithm feasible. A comparison is made b

A linear-time algorithm for four-partiti
A linear-time algorithm for four-partitioning four-connected planar graphs
โœ Shin-ichi Nakano; Md.Saidur Rahman; Takao Nishizeki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 765 KB

In this paper we give a simple linear-time algorithm to find such a partition if G is a 4-connected planar graph and ~1. ~2. 143 and u4 are located on the same face of a plane embedding of G. Our algorithm is based on a "4canonical decomposition" of G, which is a generalization of an St-numbering an