Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

82

Voted

IPL
2007

favoriteEmaildiscussreport

74views more IPL 2007»

Minimum cycle bases of direct products of complete graphs

14 years 10 months ago

Minimum cycle bases of direct products of complete graphs

Download www.people.vcu.edu

This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such bases consist entirely of triangles. © 2007 Elsevier B.V. All rights reserved.

Richard Hammack

Real-time Traffic

Complete Graphs | Direct Product | IPL 2007 | Minimum Cycle Basis |

claim paper

Related Content

» New Approximation Algorithms for Minimum Cycle Bases of Graphs

» Introducing Curvature into Globally Optimal Image Segmentation Minimum Ratio Cycles on Pro...

» Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

» On the Acyclic Chromatic Number of Hamming Graphs

» Locating sensors in paths and cycles The case of 2identifying codes

» Minimum cost capacity installation for multicommodity network flows

» Parameterized Algorithms for Directed Maximum Leaf Problems

» Efficient incremental clock latency scheduling for large circuits

» SumProduct Networks A New Deep Architecture

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Richard Hammack

Comments (0)