Keywords: پوشش درختان; Rainbow subgraph; Spanning trees;
مقالات ISI پوشش درختان (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: پوشش درختان; 05C10; Planar graphs; 3-coloring; Spanning trees;
Keywords: پوشش درختان; Complex network; Self-similarity; Spanning trees; Recursive computational method; Combinatorial problems;
Keywords: پوشش درختان; Spanning trees; Independent spanning trees; Disjoint connected dominating sets; Completely independent spanning trees; Grid;
Keywords: پوشش درختان; C72; D74; D85; Unilateral sanctions; Multilateral sanctions; Sender; Target; Networks; Spanning trees; Cutsets;
Keywords: پوشش درختان; Spanning trees; Max-leaves; ILP reformulations; Combinatorial optimization;
Keywords: پوشش درختان; primary; 05C50; secondary; 05C90; Path intersection matrices; The matrix-tree theorem; Spanning trees; Effective resistance; Information centrality;
The complexity of some families of cycle-related graphs
Keywords: پوشش درختان; Spanning trees; Chebyshev polynomials; Gear graphs; Flower graph; Sun graph; Sphere graph;
Keywords: پوشش درختان; Spanning trees; Break divisors; Matrix-tree theorem; Jacobian; Tropical Jacobian; Sandpile group; Critical group; Bernardi process; Geometric bijections;
Keywords: پوشش درختان; Circulant graphs; Gaussian networks; Spanning trees; Independent spanning trees; Fault-tolerant routing;
Keywords: پوشش درختان; Combinatorial optimization; Multiobjective optimization; Ordered median; Ordered Weighted Average; Spanning trees;
Keywords: پوشش درختان; Complex networks; Normalized Laplacian spectrum; Graph triangulations; Degree-Kirchhoff index; Kemeny’s constant; Spanning trees
Keywords: پوشش درختان; Normalized Laplacian spectrum; Subdivision graph; Degree-Kirchhoff index; Kemeny’s constant; Spanning trees
Keywords: پوشش درختان; Spanning trees; Resistance distance; Random walks on graphs;
Keywords: پوشش درختان; C72; D74; D85; Multilateral sanctions; Sender; Target; Networks; Spanning trees; Cutsets;
Keywords: پوشش درختان; Spanning trees; Tower of Hanoi graph; Degree distribution; Fractal geometry;
Keywords: پوشش درختان; Spanning trees; Line digraphs; Weighted digraphs; Out-regular digraphs
Keywords: پوشش درختان; Stereo matching; Cost aggregation; Image filtering; Spanning trees
Keywords: پوشش درختان; Quadratic 0-1 programming; Lagrangian relaxation; Spanning trees
Keywords: پوشش درختان; Optimization; Combinatorial optimization; Networks; Graphs; Trees; Spanning trees; Capacitated minimum spanning tree; Heuristics; Biased random-key genetic algorithm
Keywords: پوشش درختان; Autonomous exploration; Frontier detection; Reachability detection; Incremental algorithms; Spanning trees;
Keywords: پوشش درختان; Spanning trees; Even integer eigenvalue; Line graph; Nullity; Signless Laplacian; Laplacian; Unicyclic graph;
Keywords: پوشش درختان; Complex networks; Spanning trees; Computational complexity; Planar networks;
Keywords: پوشش درختان; Combinatorial optimization; Memetic algorithms; Spanning trees; Optical networks
Keywords: پوشش درختان; Stability; Delay per round; Network lifetime; Coverage loss; Tradeoff; Mobile sensor networks; Data gathering algorithms; Link expiration time; Spanning trees; Simulations
Keywords: پوشش درختان; 1-2-3-conjecture; Vertex-coloring 3-edge-weighting; Spanning trees
Keywords: پوشش درختان; Geodesic graphs; Non-crossing graphs; Spanning trees; Hamiltonian cycles; Perfect matchings
Möbius Stanchion Systems
Keywords: پوشش درختان; Planar graphs; combinatorial embeddings; spanning trees;
Spanning trees with leaf distance at least d
Keywords: پوشش درختان; Spanning trees; Leaf distance; Neighborhood union;
The mathematical equivalence of the “spanning tree” and row geometric mean preference vectors and its implications for preference analysis
Keywords: پوشش درختان; Decision analysis; Pairwise comparisons; Multiple criteria analysis; Graph theory; Spanning trees;
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game
Keywords: پوشش درختان; Stackelberg Games; Spanning Trees; Branch-and-cut-and-price
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
Keywords: پوشش درختان; Linear hexagonal chain; Normalized Laplacian; Degree-Kirchhoff index; Spanning trees
The formulas for the number of spanning trees in circulant graphs
Keywords: پوشش درختان; Circulant graphs; Spanning trees; Asymptotic limit; Chebyshev polynomials;
The number of spanning trees in Apollonian networks
Keywords: پوشش درختان; Apollonian networks; Spanning trees; Small-world graphs; Complex networks; Self-similar; Maximally planar; Scale-free
The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
Keywords: پوشش درختان; Spanning trees; Tree entropy; Complex networks; Self-similarity
A counterexample for the proof of implication conjecture on independent spanning trees
Keywords: پوشش درختان; Independent trees; Spanning trees; Three connectivity; Graph algorithms
A genetic algorithm based on the edge window decoder technique to optimize power distribution systems reconfiguration
Keywords: پوشش درختان; Distribution system reconfiguration; Edge window decoder technique; Genetic algorithms; Loss reduction; Optimization methods; Spanning trees
The triangular kagomé lattices revisited
Keywords: پوشش درختان; Triangular kagomé lattice; Hexagonal lattice; Spanning trees; Energy; Kirchhoff index
Combinatorics and the rigidity of CAD systems
Keywords: پوشش درختان; Combinatorics; Rigidity theory; Spanning trees; Computer aided design
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
Keywords: پوشش درختان; Approximation algorithms; Graph theory; Degree bounds; Spanning trees
A generalization of Boesch’s theorem
Keywords: پوشش درختان; Network reliability; Boesch’s theorem; tt-optimal graphs; Spanning trees
On removable edges in 3-connected cubic graphs
Keywords: پوشش درختان; Cubic graphs; Removable edges; Spanning trees; Perfect matchings
Factorizations of complete graphs into brooms
Keywords: پوشش درختان; Graph factorization; Graph labeling; Spanning trees
An optimization framework for the energy management of carrier ethernet networks with Multiple Spanning Trees
Keywords: پوشش درختان; Green networking; Carrier Grade Ethernet; Traffic engineering; Routing optimization; Network design; Spanning Trees
On the asymptotic growth rate of some spanning trees embedded in Rd
Keywords: پوشش درختان; Geometric graphs; Spanning trees; Point location;
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller–Tucker–Zemlin constraints
Keywords: پوشش درختان; Miller–Tucker–Zemlin constraints; Spanning trees; Network flows; Integer programming; Hop constraints
New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
Keywords: پوشش درختان; Graph theory; Integer programming; Spanning trees; Hop constraints; Miller–Tucker–Zemlin constraints
The number of spanning trees of a graph
Keywords: پوشش درختان; Spanning trees; Graph; Bound
The Tree of Hubs Location Problem
Keywords: پوشش درختان; Hub location; Spanning trees; Valid inequalities
An efficient approach for counting the number of spanning trees in circulant and related graphs
Keywords: پوشش درختان; Circulant graphs; Spanning trees; Recurrence relations