Keywords: رنگ آمیزی گراف; Dynamic coloring; Graph coloring
مقالات ISI رنگ آمیزی گراف (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: رنگ آمیزی گراف; OR in sports; Sport scheduling; Graph coloring; Coloring games; Latin squares
Keywords: رنگ آمیزی گراف; Proper orientation; Graph coloring; Cactus graph; Claw-free graph; Planar graph; Block graph
Keywords: رنگ آمیزی گراف; Group testing; Hypergraph; Set basis; Graph coloring; d-Disjunct matrix;
A note on the DP-chromatic number of complete bipartite graphs
Keywords: رنگ آمیزی گراف; Graph coloring; List coloring; DP-coloring;
A coloring algorithm for 4K1-free line graphs
Keywords: رنگ آمیزی گراف; Graph coloring; Claw; K5âe; Line-graph;
Energy-aware interference management for ultra-dense multi-tier HetNets: Architecture and technologies
Keywords: رنگ آمیزی گراف; Ultra-dense network; Energy-aware; Conflict graph; Graph coloring; Interference management;
Root multiplicities for Borcherds algebras and graph coloring
Keywords: رنگ آمیزی گراف; Borcherds-Kac-Moody algebras; Graph coloring; Chromatic polynomials; Root multiplicities;
Code-design for efficient pipelined layered LDPC decoders with bank memory organization
Keywords: رنگ آمیزی گراف; Parity check codes; Decoding; Channel coding; Progressive edge growth; Layered; Graph coloring; Architectures;
On color-critical (P5,co-P5)-free graphs
Keywords: رنگ آمیزی گراف; Graph coloring; P5-free graphs;
Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
Keywords: رنگ آمیزی گراف; Graph coloring; Sat; Computational complexity; Monochromatic cycles;
L(2,1)-Labeling of Kneser graphs and coloring squares of Kneser graphs
Keywords: رنگ آمیزی گراف; Frequency assignment; Wireless network; Graph coloring; L(2,1)-labeling; Kneser graph; Coloring square of graphs;
Delay sensitive and power-aware SMDP-based connection admission control mechanism in cognitive radio sensor networks
Keywords: رنگ آمیزی گراف; Cognitive radio sensor networks (CRSNs); Admission control; Quality of service (QoS); Semi Markov decision process (SMDP); Graph coloring; Kleinrock independence approximation;
A Vizing-like theorem for union vertex-distinguishing edge coloring
Keywords: رنگ آمیزی گراف; Graph coloring; Vertex distinguishing coloring;
Utilization of OpenCL for Large Graph Problems on Graphics Processing Unit
Keywords: رنگ آمیزی گراف; Graphics processing unit (GPU); OpenCL; Single source shortest path; All pair shortest path; Graph coloring;
Extremal H-colorings of trees and 2-connected graphs
Keywords: رنگ آمیزی گراف; Graph homomorphisms; H-coloring; Graph coloring; Widom-Rowlinson model; London-Hoffman inequality; 2-connected graphs;
Graph coloring and ACO based summarization for social networks
Keywords: رنگ آمیزی گراف; Short text summarization; Social networks; Ant colony optimization; Graph coloring; Text mining; Local search;
Approximation and hardness results for the maximum edge q-coloring problem
Keywords: رنگ آمیزی گراف; Hardness of approximation; Approximation algorithms; Graph coloring;
Lower Bounding Techniques for DSATUR-based Branch and Bound
Keywords: رنگ آمیزی گراف; Graph Coloring; DSATUR; Branch and Bound
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
Keywords: رنگ آمیزی گراف; Graph coloring; Planar graphs; Precoloring extension
Polynomial-time algorithms for minimum weighted colorings of (P5,P¯5)-free graphs and similar graph classes
Keywords: رنگ آمیزی گراف; Graph coloring; P5P5-free graphs
Constructions of kk-critical P5P5-free graphs
Keywords: رنگ آمیزی گراف; Graph coloring; P5P5-free graphs; Critical graphs
Backtracking based iterated tabu search for equitable coloring
Keywords: رنگ آمیزی گراف; Equitable coloring; Tabu search; Heuristics; Graph coloring; Combinatorial optimization
Inverse chromatic number problems in interval and permutation graphs
Keywords: رنگ آمیزی گراف; Inverse combinatorial optimization; Graph coloring; Interval graphs; Permutation graphs
Lessons from the Congested Clique applied to MapReduce
Keywords: رنگ آمیزی گراف; Congested Clique; Distributed algorithms; Graph coloring; MapReduce
On the minimum size of 4-uniform hypergraphs without property BB
Keywords: رنگ آمیزی گراف; Graph coloring; Hypergraph; Property BB
Closing complexity gaps for coloring problems on H-free graphs
Keywords: رنگ آمیزی گراف; Graph coloring; Precoloring extension; List coloring; Forbidden induced subgraph
A service-oriented spectrum allocation algorithm using enhanced PSO for cognitive wireless networks
Keywords: رنگ آمیزی گراف; Cognitive wireless network; Service-oriented spectrum allocation; Graph coloring; Enhanced PSO algorithm
On the set of circular total chromatic numbers of graphs
Keywords: رنگ آمیزی گراف; Graph coloring; Circular coloring; Total coloring; Circular total coloring;
Recognizing 3-colorings cycle-patterns on graphs
Keywords: رنگ آمیزی گراف; Graph coloring; 3-Coloring; Satisfiability problem; Recognizing cycle-patterns
Problems on cycles and colorings
Keywords: رنگ آمیزی گراف; Graph coloring; Cycles in graphs; Hypergraph coloring; Open problems
Partitioning and coloring graphs with degree constraints
Keywords: رنگ آمیزی گراف; Graph coloring; Critical graphs
How many wireless resources are needed to resolve the hidden terminal problem?
Keywords: رنگ آمیزی گراف; Chromatic number; Clique number; Graph coloring; Hidden terminal problem
Upper bounds on sets of orthogonal colorings of graphs
Keywords: رنگ آمیزی گراف; Orthogonal latin squares; Graph coloring; Chromatic number
4-coloring HH-free graphs when HH is small
Keywords: رنگ آمیزی گراف; Graph coloring; Forbidden induced subgraph; Linear forest; Polynomial-time algorithm
Predicting algorithmic complexity through structure analysis and compression
Keywords: رنگ آمیزی گراف; Algorithm complexity; Compression; Genetic algorithm; Graph coloring; #SAT
Average-case complexity of backtrack search for coloring sparse random graphs
Keywords: رنگ آمیزی گراف; Graph coloring; Average-case complexity; Search tree; Random graphs; Backtrack
Data reduction for graph coloring problems
Keywords: رنگ آمیزی گراف; Graph coloring; Polynomial kernels; Structural parameterizations
Computation of lucky number of planar graphs is NP-hard
Keywords: رنگ آمیزی گراف; Lucky labeling; Computational complexity; Graph coloring
A simple branching scheme for vertex coloring problems
Keywords: رنگ آمیزی گراف; Graph coloring; Graph bandwidth multicoloring; Branching scheme
Indicated coloring of graphs
Keywords: رنگ آمیزی گراف; Graph coloring; Chromatic number; Game chromatic number; Random graph; Clique-pair conjecture
Vertex coloring without large polychromatic stars
Keywords: رنگ آمیزی گراف; Graph coloring; Vertex coloring; Local condition; Upper chromatic number; C-coloring
Simpler multicoloring of triangle-free hexagonal graphs
Keywords: رنگ آمیزی گراف; Graph algorithm; Approximation algorithm; Graph coloring; Frequency planning; Cellular networks;
bb-coloring of tight graphs
Keywords: رنگ آمیزی گراف; Graph coloring; bb-coloring; Precoloring extension; Tight graphs
Irregular colorings of regular graphs
Keywords: رنگ آمیزی گراف; Irregular coloring; Graph coloring; Voltage graph
Coloring large graphs based on independent set extraction
Keywords: رنگ آمیزی گراف; Graph coloring; Independent set; Preprocessing; Tabu search; Memetic search;
Graphs with chromatic number close to maximum degree
Keywords: رنگ آمیزی گراف; Graph coloring; Brooks’ theorem; Critical graphs
Improving the extraction and expansion method for large graph coloring
Keywords: رنگ آمیزی گراف; Graph coloring; Graph kk-coloring; Independent set extraction; Memetic coloring; Progressive optimization
The sum choice number of P3□Pn
Keywords: رنگ آمیزی گراف; Graph coloring; List coloring; Sum list coloring; Sum choice number
Register allocation for write activity minimization on non-volatile main memory for embedded systems
Keywords: رنگ آمیزی گراف; Non-volatile memory; Register allocation; Graph coloring; Potential spill