4865 search results - page 406 / 973 » The Complexity of Graph Connectivity |
176
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
187
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Implementing real-time video processing systems put high requirements on computation and memory performance. FPGAs have proven to be effective implementation architecture for thes...
144
click to vote
ENDM
2007
15 years 6 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
181
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
188
click to vote
GD
2005
Springer
16 years 11 days ago
2005
Springer
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...