A5057410359- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Optimization and Search Problems
- Interconnection Networks and Systems
- Computational Geometry and Mesh Generation
- Optimization and Packing Problems
- Graph Labeling and Dimension Problems
- Limits and Structures in Graph Theory
- DNA and Biological Computing
- Vehicle Routing Optimization Methods
- Scheduling and Optimization Algorithms
- graph theory and CDMA systems
- VLSI and FPGA Design Techniques
- Caching and Content Delivery
- Graph Theory and Algorithms
- Algorithms and Data Compression
- Cryptography and Data Security
- Constraint Satisfaction and Optimization
- Scheduling and Timetabling Solutions
- Metaheuristic Optimization Algorithms Research
- Robotic Path Planning Algorithms
- Genome Rearrangement Algorithms
- Advanced Bandit Algorithms Research
- Auction Theory and Applications
- Parallel Computing and Optimization Techniques
Kyushu Institute of Technology
2015-2024
Kyushu Art Institute of Technology
2019-2024
Kyushu University
1992-2011
Carnegie Mellon University
1996
Read-once resolution (ROR) is a proof system in which the rule (A+x)(B+.
This paper studies the problem of orienting all edges a weighted graph such that maximum outdegree vertices is minimized. problem, which has applications in guard arrangement for example, can be shown to [Formula: see text]-hard generally. In this we first give optimal orientation algorithms run polynomial time following special cases: (i) input an unweighted graph, and (ii) tree. Then, by using those as sub-procedures, provide simple, combinatorial, text]-approximation algorithm general...
We study a new variant of the graph orientation problem called MAXMINO where input is an undirected, edge-weighted and objective to assign direction each edge so that minimum weighted outdegree (taken over all vertices in resulting directed graph) maximized. All weights are assumed be positive integers. This closely related job scheduling on parallel machines, machine covering problem, its goal jobs machines such covered as much possible. First, we prove strongly NP-hard cannot approximated...
This paper introduces four graph orientation problems named MAXIMIZE W-LIGHT, MINIMIZE W-HEAVY, and where W can be any fixed non-negative integer. In each problem, the input is an undirected, unweighted G objective to assign a direction every edge in so that number of vertices with outdegree at most or least resulting directed maximized minimized. A results on computational complexity polynomial-time approximability these for different values various special classes graphs are derived....