<--- Back to Details
First PageDocument Content
Tree / Planar graph / Bipartite graph / Path decomposition / Line graph / Graph theory / Graph / Universal graph
Date: 2006-11-05 15:16:17
Tree
Planar graph
Bipartite graph
Path decomposition
Line graph
Graph theory
Graph
Universal graph

Annals of Discrete Mathematics[removed]26

Add to Reading List

Source URL: renyi.hu

Download Document from Source Website

File Size: 608,71 KB

Share Document on Facebook

Similar Documents

Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski†  Abstract

Near-Optimal Compression for the Planar Graph Metric Amir Abboud∗ Paweł Gawrychowski† Abstract

DocID: 1vkO7 - View Document

Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

Computing the Girth of a Planar Graph in O(n log n) time Oren Weimann (Weizmann Institute of Science) Raphy Yuster (University of Haifa)

DocID: 1v2rQ - View Document

UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling

UNDER REVIEW, Gracker: A Graph-based Planar Object Tracker Tao Wang and Haibin Ling

DocID: 1uoNh - View Document

The random planar graph process Stefanie Gerke ∗  Dirk Schlatter

The random planar graph process Stefanie Gerke ∗ Dirk Schlatter

DocID: 1tk3p - View Document

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

DocID: 1rtvU - View Document