<--- 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

Faster	
  parallel	
  Graph	
  BLAS	
  kernels	
  and	
  new	
   graph	
  algorithms	
  in	
  matrix	
  algebra	
   Aydın	
  Buluç	
   Computa1onal	
  Research	
  Division	
   Berkeley	
  Lab	
  (LBN

Faster  parallel  Graph  BLAS  kernels  and  new   graph  algorithms  in  matrix  algebra   Aydın  Buluç   Computa1onal  Research  Division   Berkeley  Lab  (LBN

DocID: 1ri9X - View Document

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

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

DocID: 1qL0N - View Document

Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

DocID: 1pXpr - View Document

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

DocID: 1p6k0 - View Document

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1  U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

Constrained Level Generation through Grammar-Based Evolutionary Algorithms Jose M. Font*1 , Roberto Izquierdo2 , Daniel Manrique2 , and Julian Togelius3 1 U-tad, Centro Universitario de Tecnolog´ıa y Arte Digital, C/P

DocID: 1nYta - View Document