1736 search results - page 110 / 348 » The rank-width of Directed Graphs |
151
click to vote
CMOT
2004
15 years 4 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
130
click to vote
RR
2007
Springer
15 years 10 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...
158
click to vote
ESA
2005
Springer
15 years 10 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...
122
click to vote
COCOON
2003
Springer
15 years 9 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...
192
Voted
APPROX
2000
Springer
15 years 8 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...