2612 search results - page 70 / 523 » Switching Graphs and Their Complexity |
WG
2009
Springer
14 years 4 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
WWW
2004
ACM
14 years 10 months ago
2004
ACM
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
ESANN
2008
13 years 11 months ago
2008
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...