325 results on '"Tomita, Etsuji"'
Search Results
2. Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
3. Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
4. Speeding-Up of Construction Algorithms for the Graph Coloring Problem
5. Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
6. Clique Enumeration
7. Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound
8. A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
9. A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs
10. A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State
11. Enumerating Maximal Clique Sets with Pseudo-Clique Constraint
12. A fast and complete algorithm for enumerating pseudo-cliques in large graphs
13. A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
14. Editors’ Introduction
15. Relational Change Pattern Mining Based on Modularity Difference
16. Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search
17. Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers
18. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
19. Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
20. A fast and complete algorithm for enumerating pseudo-cliques in large graphs
21. Speeding-Up Construction Algorithms for the Graph Coloring Problem
22. Learning Boolean Functions in AC 0 on Attribute and Classification Noise
23. Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
24. The Worst-Case Time Complexity for Generating All Maximal Cliques
25. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
26. A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample
27. A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs
28. A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
29. Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound
30. Learning Boolean functions in [formula omitted] on attribute and classification noise—Estimating an upper bound on attribute and classification noise
31. On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
32. A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State
33. Enumerating Maximal Clique Sets with Pseudo-Clique Constraint
34. Clique Enumeration
35. Assignment Problem
36. Universal Sequencing on an Unreliable Machine
37. Knapsack
38. Rate-Monotonic Scheduling
39. An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
40. Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search
41. Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics
42. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
43. Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers
44. The worst-case time complexity for generating all maximal cliques and computational experiments
45. The Performance of a Metaheuristic Algorithm for Finding a Maximal Weight Clique in the Fill-in-Blank Problem
46. A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data
47. Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
48. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
49. The extended equivalence problem for a class of non-real-time deterministic pushdown automata
50. Polynomial time learning of simple deterministic languages via queries and a representative sample
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.