<--- Back to Details
First PageDocument Content
Graph theory / Intersection graph / Martin Charles Golumbic / Graph / Planar graph / Bipartite graph / Contact graph / Treewidth / Chordal graph / Book:Graph Drawing / Book:Graph Algorithms
Date: 2016-06-04 11:41:50
Graph theory
Intersection graph
Martin Charles Golumbic
Graph
Planar graph
Bipartite graph
Contact graph
Treewidth
Chordal graph
Book:Graph Drawing
Book:Graph Algorithms

Chaplick, Steven Curriculum Vitae June 2016 Address: Lehrstuhl für Informatik I, Universität Würzburg, Am Hubland, DWürzburg, Germany.

Add to Reading List

Source URL: www1.informatik.uni-wuerzburg.de

Download Document from Source Website

File Size: 159,96 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