159 search results - page 13 / 32 » Undirected Graphs of Entanglement 2 |
WG
2005
Springer
14 years 6 days ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
AAIM
2007
Springer
14 years 27 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
NETWORKS
2002
13 years 6 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
COLT
2004
Springer
14 years 3 days ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...