540 search results - page 53 / 108 » New bounds on the edge number of a k-map graph |
DM
2008
13 years 9 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
ISBRA
2009
Springer
14 years 3 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
CP
2011
Springer
12 years 8 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...