Back to Results
First PageMeta Content
Spanning tree / Tree / Minimum spanning tree / Graph / Pseudoforest / Connectivity / Graph theory / Mathematics / Theoretical computer science


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A note on α-drawable k-trees David Bremner∗ Jonathan Lenchner†
Add to Reading List

Document Date: 2008-10-29 00:08:55

Open Document

File Size: 172,14 KB

Share Result on Facebook

City

Holetown / /

Company

AMS Press / CRC Press / IBM / /

Country

Barbados / /

/

Facility

Bellairs Research Institute / University of Perugia / University of Lethbridge / McGill University / /

IndustryTerm

data mining / time drawing algorithms / Biological applications / /

Organization

School of Computer Science / Faculty of Computer Science / Department of Mathematics and Computer / Bellairs Research Institute / School of Computing / McGill University / University of Lethbridge / University of Perugia / University of New Brunswick / /

Person

Svetlana Stolpnerk Christophe Paul / Graph Drawing / Marc Pouget¶ Stephen Wismath / Sue Whitesides / Muhammad Abubakr / David Bremner∗ Jonathan Lenchner / Raimund Seidel / Sylvain Lazard / Jonathan Lenchner† Giuseppe Liotta / Giuseppe Liotta‡ Svetlana Stolpnerk / Hazel Everett / /

Position

Vp / editor / Voronoi cell Vp / /

ProvinceOrState

New Brunswick / /

Technology

Alpha / RAM / linear time drawing algorithms / data mining / /

SocialTag