641 search results - page 108 / 129 » On Planar Quasi-Parity Graphs |
ALGORITHMICA
2004
13 years 9 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
SODA
1994
ACM
13 years 10 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
SIAMDM
2010
13 years 7 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
ECCC
2008
13 years 9 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
JGT
2008
13 years 9 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...