2612 search results - page 184 / 523 » Switching Graphs and Their Complexity |
135
click to vote
FSTTCS
2009
Springer
15 years 11 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...
147
click to vote
IPPS
2007
IEEE
15 years 10 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...
102
click to vote
ENDM
2007
15 years 4 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...
130
click to vote
DATE
2007
IEEE
15 years 10 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 ...
139
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...