Keywords: رنگ آمیزی ورتکس; Tabu search; Heuristics; Infeasible local search; Equitable coloring; Vertex coloring;
مقالات ISI رنگ آمیزی ورتکس (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: رنگ آمیزی ورتکس; Vertex Coloring; Partitioning coloring; Selective coloring; Column generation; Branch-and-Price algorithm;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Integer programming; Chromatic violation;
Keywords: رنگ آمیزی ورتکس; clique; stable set; vertex coloring; structure; algorithms;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Coupon coloring; Coupon coloring number; Cograph;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Double-critical graphs; Claw-free graphs;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Polynomial-time algorithm; Fixed-parameter tractability;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Colorful path; Rainbow coloring;
Keywords: رنگ آمیزی ورتکس; Immersion; Vertex coloring; Abu-Khzam and Langston's conjecture; Dense graphs;
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Stable set; Mixed integer linear programming; Computational experiments;
Keywords: رنگ آمیزی ورتکس; Subcubic graphs; Span; Vertex coloring; Computational complexity
Keywords: رنگ آمیزی ورتکس; Vertex coloring; star coloring; clique number; graph classes
Keywords: رنگ آمیزی ورتکس; Planar graph; Vertex coloring; Steinberg’s Conjecture
Keywords: رنگ آمیزی ورتکس; Wireless mesh networks; Link scheduling; Physical interference model; Vertex coloring; Vertex multicoloring
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Puzzles; Partitions
Keywords: رنگ آمیزی ورتکس; Winner determination; Combinatorial auctions; Maximum weight clique; Vertex coloring; Exact search
Keywords: رنگ آمیزی ورتکس; Combinatorial problems; Vertex coloring; Fractional programming formulation; Mixed integer linear programming problem
Keywords: رنگ آمیزی ورتکس; Grammar induction; Automata induction; Vertex coloring; Satisfiability; Identification in the limit
Keywords: رنگ آمیزی ورتکس; Signed graphs; Chromatic number; Vertex coloring; Chromatic spectrum
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Standard formulation; Polyhedral characterization
Acyclic and star coloring of P4-reducible and P4-sparse graphs
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Join; Disjoint union; Cographs; P4-reducible graphs; P4-spare graphs;
The complexity of the proper orientation number
Keywords: رنگ آمیزی ورتکس; Computational complexity; Proper orientation; Vertex coloring; NP-completeness; Planar 3-SAT (type 2); Graph orientation; Polynomial algorithms
The acyclic and Câ3-free disconnection of tournaments
Keywords: رنگ آمیزی ورتکس; Tournament; Vertex coloring; Acyclic disconnection; Câ3-free disconnection;
Triangle-free 2P3-free graphs are 4-colorable
Keywords: رنگ آمیزی ورتکس; Triangle-free graph; 2P3-free graph; Vertex coloring; Chromatic number;
On the difference between chromatic number and dynamic chromatic number of graphs
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Dynamic coloring; Independent number
Max-optimal and sum-optimal labelings of graphs
Keywords: رنگ آمیزی ورتکس; Graph algorithms; Rank number; Vertex coloring
Exact weighted vertex coloring via branch-and-price
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Column generation; Branch-and-price; Computational experiments
Vertex coloring without large polychromatic stars
Keywords: رنگ آمیزی ورتکس; Graph coloring; Vertex coloring; Local condition; Upper chromatic number; C-coloring
A characterization of claw-free bb-perfect graphs
Keywords: رنگ آمیزی ورتکس; Vertex coloring; bb-coloring; bb-perfect graph; Claw-free graph
An effective heuristic algorithm for sum coloring of graphs
Keywords: رنگ آمیزی ورتکس; Sum coloring; Vertex coloring; Independent set; Heuristics;
A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
Keywords: رنگ آمیزی ورتکس; Graph; Maximum (weight) stable set; Vertex coloring; Necessary and sufficient condition; Algorithm; Multi-agent system; Group consensus
NoteParity vertex coloring of outerplane graphs
Keywords: رنگ آمیزی ورتکس; Plane graph; Facial walk; Vertex coloring;
Formation control using range-only measurements
Keywords: رنگ آمیزی ورتکس; Multi-agent formation; Range-only measurement; Discrete-time algorithm; Vertex coloring; Cayley–Menger determinant
Ohba’s conjecture for graphs with independence number five
Keywords: رنگ آمیزی ورتکس; Chromatic number; Vertex coloring; List coloring; List chromatic number; Choosability; Complete multipartite graph
Bounding χχ in terms of ωω and ΔΔ for some classes of graphs
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Chromatic number; Clique number; Maximum degree
An exact approach for the Vertex Coloring Problem
Keywords: رنگ آمیزی ورتکس; Vertex Coloring; Column generation; Branch-and-Price; Computational experiments
Greedy algorithms for generalized k-rankings of paths
Keywords: رنگ آمیزی ورتکس; Rank number; Ordered coloring; Minimal ranking; Vertex coloring; Greedy algorithm; Graph algorithm
Hall number for list colorings of graphs: Extremal results
Keywords: رنگ آمیزی ورتکس; Graph; Vertex coloring; List coloring; Hall condition; Hall number
Complexity of conditional colorability of graphs
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Conditional coloring; (Conditional) chromatic number; Algorithm; Complexity; NP-complete
Minimal k-rankings and the rank number of Pn2
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Minimal k-ranking; Rank number; Arank number; kth power of a path; Graph algorithms;
Graph coloring with cardinality constraints on the neighborhoods
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Bipartite graph; Tree; Cardinality constrained colorings
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees
Keywords: رنگ آمیزی ورتکس; Mixed hypergraph; Vertex coloring; Interval hypergraph; Hypertree; Circular hypergraph; Chromatic spectrum; Feasible set
A Brooks-type bound for squares of K4K4-minor-free graphs
Keywords: رنگ آمیزی ورتکس; Chromatic number; Vertex coloring; Brooks-type bound; Square of a graph; Series–parallel graph
Color-bounded hypergraphs, I: General results
Keywords: رنگ آمیزی ورتکس; Hypergraph; Vertex coloring; Chromatic polynomial; Feasible set; Uniquely colorable hypergraph; Mixed hypergraph
Chromatic coloring with a maximum color class
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Chromatic coloring; Maximum degree; Chromatic number; Independence number
Inapproximability and approximability of minimal tree routing and coloring
Keywords: رنگ آمیزی ورتکس; Tree routing; Tree coloring; Vertex coloring; Approximability
Vertex coloring acyclic digraphs and their corresponding hypergraphs
Keywords: رنگ آمیزی ورتکس; 05C15; 05C20; 05C65; 05C85; 05D90; 06A06Genetic databases; Digraph; Ancestor; Down-set; Vertex coloring; Hypergraph; Block design
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Keywords: رنگ آمیزی ورتکس; Graph coloring benchmarks; Heuristics; Local search; Vertex coloring
Embedding a novel objective function in a two-phased local search for robust vertex coloring
Keywords: رنگ آمیزی ورتکس; Benchmarks; Biased random sampling; Vertex coloring; Local search
Entropy and a certain cost-minimal coloring of graph vertices
Keywords: رنگ آمیزی ورتکس; Vertex coloring; Cost-minimal coloring; Entropy bound; Maximum entropy