Open Access(Nearly-)Tight Bounds on the Linearity and Contiguity of Cographs
Author(s) -
Christophe Crespelle,
Philippe Gambette
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - combinatorics , mathematics , contiguity , linearity , upper and lower bounds , omega , discrete mathematics , binary logarithm , path (computing) , tree (set theory) , cograph , mathematical proof , chordal graph , graph , computer science , physics , operating system , mathematical analysis , geometry , 1 planar graph , quantum mechanics , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom