3471 search results - page 206 / 695 » Obstacle Numbers of Graphs |
123
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
145
Voted
WG
2004
Springer
15 years 10 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
138
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
125
Voted
AI
2002
Springer
15 years 4 months ago
2002
Springer
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
136
Voted
TOMS
2010
15 years 3 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...