Keywords: Privacy measure; Social networks; Active attack; Empirical evaluation; 68Q25; 68W25; 05C85;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: 15A18; 05C50; 05C85; Threshold graph; Characteristic polynomial; Cospectral graphs;
Keywords: 05C50; 05C85; 15A18; Adjacency matrix; Eigenvalue; Small clique-width;
Keywords: primary; 05C81; 15A15; secondary; 05C85; Finite networks; Uniform spanning tree; Spanning forests; Determinantal processes; Transfer current theorem;
Keywords: Signless Laplacian matrix; Characteristic polynomial; Generalized lollipop graphs; 15A18; 05C50; 05C85;
Keywords: 05C69; 05C85; Grundy total domination number; Vertex cover; Tree; Split graph; Modular decomposition;
Keywords: 05C05; 05C20; 05C85; 05D15; 92D15; Phylogenetic network; Tree-based network; Antichain; Path partition; Dilworth's theorem;
Keywords: 05C50; 05C85; 15A18; Distance spectrum; Threshold graphs; Distinct eigenvalues; Equitable partition;
Keywords: 05C50; 05C85; 15A52; 15A18; Random graphs; Geometric graphs; Circulant matrices; Random matrices; Rank correlation coefficient;
Keywords: 05C15; 05C31; 05C85; 68Q17; 68W05; Graph polynomials; Counting complexity; Chromatic polynomial;
Keywords: 05C50; 05C85; 15A52; 15A18; Random graphs; Toeplitz Matrices; Random Matrices; Seriation problem; Stochastic Block Model; Rank correlation coefficient;
Keywords: Connected vertex cover problem; Approximation algorithm; 4-regular graph; 05C85; 05C70;
Keywords: Mixed metric dimension; Edge metric dimension; Metric dimension; 05C12; 05C85; 05C90;
Keywords: Number of spanning trees; Wheel graph; Gear graph; Asymptotic growth; 05C85; 05C05; 05C50;
Keywords: 05C30; 05C85; 05A15; Fibonacci numbers; Phylogenetics; Trees; Convexity; Counting; Algorithms;
Keywords: 90C27; 05C70; 05C85; 68R10; Combinatorial algorithm; Matching theory; Traveling salesman problem; Restricted 2-matching; Subtour elimination constraint; Hamilton-laceable graph;
Keywords: Graph; Edge-neighbor-scattering number; Polynomial algorithm; Tree; 05C85;
Keywords: 05C35; 05C50; 05C78; 05C85; 68R10Positive zero forcing number; Clique cover number; Chordal graphs; Computational complexity
Keywords: 05C85; 90C27; Edge dominating set; Multicut; Primal-dual algorithm;
Keywords: 05C85; 68R10Phylogenetic network; Reticulation-visible network; Tree Containment problem
Keywords: 05C70; 68W40; 05C85; Stable matching; Restricted edge; Approximation algorithm;
Keywords: 92D30; 05C05; 05C20; 60J10; 60J27; 05C85; Rooted ranked planar binary tree; Contact network; Susceptible-infected epidemic model; Non-parametric combinatorial stochastic process; Parametric Beta-splitting model; Random graph models; Meme evolution;
Keywords: 05C85; 05C25; 05C50; 68R; 35QGraph algorithms; Graphs and groups; Graphs and matrices; Discrete mathematics in relation to computer science; Equations of mathematical physics and other areas of application
Keywords: 15A80; 15A18; 60J10; 05C05; 05C85; Markov chain; Universal algorithm; Commutative semiring; State reduction;
Keywords: 05C15; 05C50; 05C85; 90C27; 65D25; 65F50; Grid coloring algorithm; Divide-and-conquer approach; Lipton-Tarjan separator; Stencil discretization; Derivative computation; Sparsity exploitation;
Computing the k-metric dimension of graphs
Keywords: k-metric dimension; k-metric dimensional graph; Metric dimension; NP-complete problem; NP-hard problem; Graph algorithms; 68Q17; 05C05; 05C12; 05C85;
Polynomial kernels for deletion to classes of acyclic digraphs
Keywords: 68R10; 05C10; 05C85; Directed feedback vertex set; Kernelization; Out-forest;
Highly efficient epidemic spreading model based LPA threshold community detection method
Keywords: Overlapping community detection; Epidemic model; Information spreading; Largest Eigenvalue; Behavior analysis; 05c85; 68T20; 91C20;
On dynamic monopolies of graphs: The average and strict majority thresholds
Keywords: 91D30; 05C85; O5C69Irreversible spread of influence; Dynamic monopolies
The dominance assignment problem
Keywords: 90C27; 05A05; 65F30; 05C85; 90B80Assignment problem; Bottleneck assignment; Lexicographic bottleneck assignment; Clutter; Combinatorial matrices; Permutations
An algorithm for finding a maximum tt-matching excluding complete partite subgraphs
Keywords: 05C85; 68R10; 90C27bb-matching; Complete partite graph; Polynomial-time algorithm; Shrinking
On shortest disjoint paths in planar graphs
Keywords: 05C85; 68R10; 90C27; 90C35Disjoint paths; Shortest path; Planar graph; Objective function; Minimum cost flow
Minimum mean cycle problem in bidirected and skew-symmetric graphs
Keywords: 05C38; 05C85; 90C27Bidirected graph; Skew-symmetric graph; Minimum mean cycle
Cost thresholds for dynamic resource location
Keywords: 05C85; 90B22; 90B80; Dynamic location; Window index; Lookahead; Dynamic optimization;
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Keywords: 05C35; 05C85; 68W25; 68R10Maximum cut; Cubic graph; Approximation algorithm; Vertex decomposition; Unicyclic graph
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
Topological sweep of the complete graph
Keywords: 68R10; 05C85; 05C10Embedded graph algorithms; Plane sweep; Topological sweep; Geometric degeneracies; Data depth
On encodings of spanning trees
Keywords: 05C05; 05C85; 68R10Spanning tree; Complete multipartite graph; Bijection
On the 2-rainbow domination in graphs
Keywords: 05C85; 05C69Complexity; NP-completeness; Domination; Cartesian product; Generalized Petersen graph
An improved algorithm for the p-center problem on interval graphs with unit lengths
Keywords: 05C85; 90C27p-center problem; Interval graph; Location
The strong metric dimension of graphs and digraphs
Keywords: 05C12; 05C20; 05C85; 05C90Strong dimension; Vertex covering number; Weak and unilateral dimension of digraphs
Paired domination on interval and circular-arc graphs
Keywords: 05C69; 05C85; 68Q25; 68R10; 68W05Interval graph; Circular-arc graph; Paired domination
Feedback numbers of Kautz digraphs
Keywords: 05C85; 68R10Feedback vertex set; Feedback number; Kautz digraphs; Cycles; Acyclic subgraph
Eliminating graphs by means of parallel knock-out schemes
Keywords: 05C75; 05C35; 05C85; 68R10Knock-out number; Parallel knock-out scheme; Hamiltonian cycle; Perfect matching; Tree; Claw-free graph; Computational complexity; Dynamic programming
Selection of programme slots of television channels for giving advertisement: A graph theoretic approach
Keywords: Primary codes: 05C15; 05C17; 05C85; 05C90; Secondary codes: 68R10; 68W05Modelling; Colouring; Interval numbers; Interval graphs
Irreducible (v3)(v3) configurations and graphs
Keywords: 05C62; 05C85; 68R05; 68R10Incidence structure; Configuration; Cubic graph
On the maximum cardinality search lower bound for treewidth
Keywords: 05C85; 68Q25; 68R10Maximum cardinality search; Treewidth; Lower bounds; Planar graphs; Graph algorithms