1756 search results - page 97 / 352 » Directed scale-free graphs |
152
click to vote
RR
2007
Springer
15 years 12 months ago
2007
Springer
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
187
Voted
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
144
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
219
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
218
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...