Combinatorial Algorithms: Theory and Practice
Explore this paper's citation graph
- Type
- book
- Published
- 1977-01-01
- Cited by
- 812
- References
- 0
- OpenAlex
- https://openalex.org/W1514415888
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:264258841
Keywords
Computer science, Algorithm
References
No references recorded for this paper.
Cited by
- The Graph Isomorphism Problem
- Algebraic-grammatical approach to interface design
- An Efficient Relevance Criterion for Mechanical Theorem Proving
- Methods of Constructing Argument of Objective Function in Combinatorial Optimization Problems
- Generalized Algorithm for Restricted Weak Composition Generation
- Description combinatoire des ultramétriques
- A fast approximation for minimum spanning trees in k-dimensional space
- Ranking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis
- Phase locking in coupled oscillators as hybrid automata
- Solution of a minimax scheduling problem by dichotomous search
- Improvements of Concurrent Automata Generation
- The Systematized Collection of Daubechies Wavelets
- Some Algorithm Design Methods
- Design of Supervisors to Avoid Deadlock in Flexible Assembly Systems
- Shape Comparison based on Skeleton Isomorphism
- Distribution of Increasing ℓ-sequences in a Random Permutation
- A Note on the Number of Perfect Matchings of Bipartite Graphs
- A Density-Based General Greedy Channel Routing Algorithm in VLSI Design Automation.
- Interpolation and optimal monitoring in space and time
- Writing efficient code
Related papers
- The Art of Computer Programming
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- The Design and Analysis of Computer Algorithms
- Graph theory
- Combinatorial Optimization: Algorithms and Complexity
- Depth-First Search and Linear Graph Algorithms
- The Art of Computer Programming: Volume 3: Sorting and Searching
- Fundamentals of Computer Algorithms