The following pages link to Elias Dahlhaus (Q233438):
Displaying 50 items.
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
- (Q1085983) (redirect page) (← links)
- Concerning two-adjacent context-free languages (Q1085985) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- On the existence of polynomial time algorithms for interpolation problems in propositional logic (Q1118581) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- The train marshalling problem (Q1570821) (← links)
- A characterization of strongly chordal graphs (Q1584312) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Efficient and Practical Algorithms for Sequential Modular Decomposition (Q2775895) (← links)
- (Q3138901) (← links)
- (Q3221973) (← links)
- (Q3665094) (← links)
- (Q3713561) (← links)
- (Q3727407) (← links)
- (Q3741099) (← links)
- (Q3775538) (← links)
- (Q3804207) (← links)
- (Q3808118) (← links)
- (Q3817599) (← links)
- (Q3832048) (← links)
- (Q3839007) (← links)
- (Q4202933) (← links)
- (Q4232801) (← links)
- (Q4268491) (← links)
- On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs (Q4275334) (← links)
- (Q4281631) (← links)
- Fast Parallel Recognition of Ultrametrics and Tree Metrics (Q4302265) (← links)
- The Complexity of Multiterminal Cuts (Q4305362) (← links)
- (Q4373674) (← links)
- (Q4373676) (← links)
- (Q4470503) (← links)
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition (Q4500853) (← links)
- (Q4525268) (← links)
- (Q4533374) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)