Sciweavers

250 search results - page 16 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
JGAA
2010
128views more  JGAA 2010»
13 years 6 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
14 years 2 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
CSE
2009
IEEE
14 years 3 months ago
Enabling Privacy as a Fundamental Construct for Social Networks
The current set of social networking platforms, e.g. Facebook and MySpace, has created a new class of Internet applications called social software. These systems focus on leveragi...
E. Michael Maximilien, Tyrone Grandison, Kun Liu, ...
PLDI
2009
ACM
14 years 9 months ago
Sharing classes between families
Class sharing is a new language mechanism for building extensible software systems. Recent work has separately explored two different kinds of extensibility: first, family inherit...
Xin Qi, Andrew C. Myers