2612 search results - page 11 / 523 » Switching Graphs and Their Complexity |
TCS
2010
13 years 4 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
EJC
2010
13 years 10 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
IPL
2007
13 years 9 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
MFCS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...