AAAAAA
Results:
1-10
|
Results: 10
Authors:
DAHLHAUS E
KARPINSKI M
Citation: E. Dahlhaus et M. Karpinski, MATCHING AND MULTIDIMENSIONAL MATCHING IN CHORDAL AND STRONGLY CHORDAL GRAPHS, Discrete applied mathematics, 84(1-3), 1998, pp. 79-91
Authors:
ANDREEV AE
CLEMENTI A
CRESCENZI P
DAHLHAUS E
DEAGOSTINO S
ROLIM JDP
Citation: Ae. Andreev et al., THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH-DEGREE SUBGRAPH PROBLEM, Theoretical computer science, 205(1-2), 1998, pp. 261-282
Authors:
DAHLHAUS E
MANUEL PD
MILLER M
Citation: E. Dahlhaus et al., MAXIMUM H-COLORABLE SUBGRAPH PROBLEM IN BALANCED GRAPHS, Information processing letters, 65(6), 1998, pp. 301-303
Authors:
DAHLHAUS E
KRATOCHVIL J
MANUEL PD
MILLER M
Citation: E. Dahlhaus et al., TRANSVERSAL PARTITIONING IN BALANCED HYPERGRAPHS, Discrete applied mathematics, 79(1-3), 1997, pp. 75-89
Authors:
DAHLHAUS E
Citation: E. Dahlhaus, EFFICIENT PARALLEL RECOGNITION ALGORITHMS OF COGRAPHS AND DISTANCE HEREDITARY GRAPHS, Discrete applied mathematics, 57(1), 1995, pp. 29-44
Authors:
DAHLHAUS E
DAMASCHKE P
Citation: E. Dahlhaus et P. Damaschke, A PARALLEL SOLUTION OF DOMINATION PROBLEMS ON CHORDAL AND STRONGLY CHORDAL GRAPHS, Discrete applied mathematics, 52(3), 1994, pp. 261-273
Authors:
DAHLHAUS E
Citation: E. Dahlhaus, A PARALLEL ALGORITHM FOR COMPUTING STEINER TREES IN STRONGLY CHORDAL GRAPHS, Discrete applied mathematics, 51(1-2), 1994, pp. 47-61
Authors:
DAHLHAUS E
KARPINSKI M
Citation: E. Dahlhaus et M. Karpinski, AN EFFICIENT PARALLEL ALGORITHM FOR THE MINIMAL ELIMINATION ORDERING (MEO) OF AN ARBITRARY GRAPH, Theoretical computer science, 134(2), 1994, pp. 493-528
Authors:
DAHLHAUS E
JOHNSON DS
PAPADIMITRIOOU CH
SEYMOUR PD
YANNAKAKIS M
Citation: E. Dahlhaus et al., THE COMPLEXITY OF MULTITERMINAL CUTS, SIAM journal on computing, 23(4), 1994, pp. 864-894
Authors:
DAHLHAUS E
Citation: E. Dahlhaus, FAST PARALLEL RECOGNITION OF ULTRAMETRICS AND TREE METRICS, SIAM journal on discrete mathematics, 6(4), 1993, pp. 523-532
Risultati:
1-10
|