Sciweavers

33 search results - page 3 / 7

» endm 2008

43

ENDM
2008

53views more ENDM 2008»

A robust P2P streaming architecture and its application to a high quality live-video service

14 years 12 months ago

A robust P2P streaming architecture and its application to a high quality live-video service

Download www.irisa.fr

Héctor Cancela, Franco Robledo Amoza, Pablo...

claim paper

Read More »

46

ENDM
2008

51views more ENDM 2008»

A Polynomial Bound for Untangling Geometric Planar Graphs

14 years 12 months ago

A Polynomial Bound for Untangling Geometric Planar Graphs

Download www.ms.unimelb.edu.au

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat...

claim paper

Read More »

79

ENDM
2008

88views more ENDM 2008»

Stars and Bonds in Crossing-Critical Graphs

14 years 12 months ago

Stars and Bonds in Crossing-Critical Graphs

Download www.fi.muni.cz

The structure of all known infinite families of crossing

Petr Hlinený, Gelasio Salazar

claim paper

Read More »

74

ENDM
2008

57views more ENDM 2008»

Six-Critical Graphs on the Klein Bottle

14 years 12 months ago

Six-Critical Graphs on the Klein Bottle

Download www.carlyerger.com

Abstract Nathan Chenette Ken-ichi Kawarabayashi Daniel Kr

Nathan Chenette, Luke Postle, Noah Streib, Robin T...

claim paper

Read More »

98

ENDM
2008

93views more ENDM 2008»

On Universal Graphs of Minor Closed Families

14 years 12 months ago

On Universal Graphs of Minor Closed Families

Download www.labri.fr

For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...

Arnaud Labourel

claim paper

Read More »

« Prev « First page 3 / 7 Last » Next »