Add to ORKGThe maximal path set (MPS) problem is to find, given an undirected graph $G=(V, E) $ , a maximal subset $F $ of $E $ such that the subgraph induced by $F $ is a forest in which each connected component i
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k termina...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
Let G = (V, E) be a connected, undirected, edge-weighted graph. A subgraph of G satisfying a certain...
The maximal linear forest problem is to find, given a graph G = (V, E), a maximal subset of V that i...
AbstractWe present two parallel algorithms for finding a maximal set of paths in a given undirected ...
AbstractIt is shown that the problem of finding a maximal set of paths in a given (undirected or dir...
AbstractWe show that the problem of finding a maximal vertex-induced (resp., edge-induced) subgraph ...
Proc. Toyohashi Symposium on Theoretical Computer Science, 97-101We show that the problem of finding...
Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cyc...
A maximal bipartite set (MBS) in an undirected graph $G = (V, E)$ is a maximal collection of vertic...
AbstractAn algorithm for finding maximal chordal subgraphs is developed that has worst-case time com...
Longest directed path length (LDPL) is defined by the length of the longest path of the directed acy...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
Whether or not the problem of finding maximal indepen-dent sets (MIS) in hypergraphs is in (R)NC is ...
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k termina...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
Let G = (V, E) be a connected, undirected, edge-weighted graph. A subgraph of G satisfying a certain...
The maximal linear forest problem is to find, given a graph G = (V, E), a maximal subset of V that i...
AbstractWe present two parallel algorithms for finding a maximal set of paths in a given undirected ...
AbstractIt is shown that the problem of finding a maximal set of paths in a given (undirected or dir...
AbstractWe show that the problem of finding a maximal vertex-induced (resp., edge-induced) subgraph ...
Proc. Toyohashi Symposium on Theoretical Computer Science, 97-101We show that the problem of finding...
Algorithms for listing the subgraphs satisfying a given property (e.g., being a clique, a cut, a cyc...
A maximal bipartite set (MBS) in an undirected graph $G = (V, E)$ is a maximal collection of vertic...
AbstractAn algorithm for finding maximal chordal subgraphs is developed that has worst-case time com...
Longest directed path length (LDPL) is defined by the length of the longest path of the directed acy...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
Whether or not the problem of finding maximal indepen-dent sets (MIS) in hypergraphs is in (R)NC is ...
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k termina...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
Let G = (V, E) be a connected, undirected, edge-weighted graph. A subgraph of G satisfying a certain...