The following pages link to Yehoshua Perl (Q686519):
Displaying 29 items.
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- Efficient implementation of a shifting algorithm (Q1070825) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- Generalized Fibonacci maximum path graphs (Q1136779) (← links)
- Understanding the complexity of interpolation search (Q1245570) (← links)
- The new class of \(g\)-chain periodic sorters (Q1273856) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- Better understanding of Batcher's merging networks (Q1824402) (← links)
- The shifting algorithm technique for the partitioning of trees (Q1900135) (← links)
- A counter example to a conjecture of D. J. Rose on minimum triangulation (Q2559391) (← links)
- Best location of service centers in a treelike network under budget constraints (Q2639769) (← links)
- Efficient Optimization of Monotonic Functions on Trees (Q3043168) (← links)
- Optimum split trees (Q3336707) (← links)
- The periodic balanced sorting network (Q3476271) (← links)
- Shifting algorithms for tree partitioning with general weighting functions (Q3667953) (← links)
- Circuit partitioning with size and connection constraints (Q3670554) (← links)
- Digraphs with maximum number of paths and cycles (Q3789372) (← links)
- An OODB part-whole model: Semantics, notation and implementation (Q3840925) (← links)
- (Q3890126) (← links)
- Max-Min Tree Partitioning (Q3902511) (← links)
- Mean flow scheduling and optimal construction of a treelike communication network (Q3909997) (← links)
- The edge inducibility of graphs (Q3910550) (← links)
- (Q3912029) (← links)
- The complexity of identifying redundant and essential elements (Q3926037) (← links)
- A Shifting Algorithm for Min-Max Tree Partitioning (Q3933759) (← links)
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph (Q4140364) (← links)
- Interpolation search—a log log <i>N</i> search (Q4157947) (← links)
- The complexity of finding maximum disjoint paths with length constraints (Q4741713) (← links)
- (Q5283997) (← links)
