Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Combinatorial Optimization and Graph Algorithms [[electronic resource] ] : Communications of NII Shonan Meetings / / edited by Takuro Fukunaga, Ken-ichi Kawarabayashi
| Combinatorial Optimization and Graph Algorithms [[electronic resource] ] : Communications of NII Shonan Meetings / / edited by Takuro Fukunaga, Ken-ichi Kawarabayashi |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (IX, 120 p. 11 illus., 2 illus. in color.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Operations research Decision making Discrete Mathematics in Computer Science Discrete Mathematics Operations Research/Decision Theory |
| ISBN | 981-10-6147-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems -- Graph Stabilization: A Survey -- Spider Covering Algorithms for Network Design problems -- Discrete Convex Functions on Graphs and Their Algorithmic Applications -- Parameterized Complexity of the Workflow Satisfiability Problem. |
| Record Nr. | UNINA-9910254847803321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNINA-9910143900603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNISA-996465400303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings / / edited by Dan Hirschberg, Gene Meyers
| Combinatorial Pattern Matching [[electronic resource] ] : 7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings / / edited by Dan Hirschberg, Gene Meyers |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (VIII, 400 p.) |
| Disciplina | 006.4/01/5116 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Discrete mathematics Algorithms Natural language processing (Computer science) Information storage and retrieval Theory of Computation Pattern Recognition Discrete Mathematics Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval |
| ISBN | 3-540-68390-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A faster algorithm for approximate string matching -- Boyer-Moore strategy to efficient approximate string matching -- Randomized efficient algorithms for compressed strings: the finger-print approach -- Filtration with q-samples in approximate string matching -- Computing discoveries in molecular biology -- Approximate dictionary queries -- Approximate multiple string search -- A 2 2/3-approximation algorithm for the shortest superstring problem -- Suffix trees on words -- The suffix tree of a tree and minimizing sequential transducers -- Perfect hashing for strings: Formalization and algorithms -- Spliced alignment: A new approach to gene recognition -- Original Synteny -- Fast sorting by reversal -- A double combinatorial approach to discovering patterns in biological sequences -- Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization -- Improved approximation algorithms for tree alignment -- The asymmetric median tree — A new model for building consensus trees -- Constructing computer virus phylogenies -- Docking of conformationally flexible proteins -- Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract) -- Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem -- Alphabet independent and dictionary scaled matching -- Analysis of two-dimensional approximate pattern matching algorithms -- Approximation algorithms for maximum two-dimensional pattern matching -- Efficient parallel algorithms for tree editing problems -- Approximate pattern matching in directed graphs -- Finite-state computability of annotations of strings and trees (extended abstract). |
| Record Nr. | UNISA-996465597403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield
| Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Discrete mathematics Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Discrete Mathematics Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48450-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. |
| Record Nr. | UNISA-996466248203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XI, 293 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Discrete mathematics Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Pattern Recognition Algorithm Analysis and Problem Complexity Discrete Mathematics Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47357-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Probabilistic analysis of generalized suffix trees -- A language approach to string searching evaluation -- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm -- Fast multiple keyword searching -- Heaviest increasing/common subsequence problems -- Approximate regular expression pattern matching with concave gap penalties -- Matrix longest common subsequence problem, duality and hilbert bases -- From regular expressions to DFA's using compressed NFA's -- Identifying periodic occurrences of a template with applications to protein structure -- Edit distance for genome comparison based on non-local operations -- 3-D substructure matching in protein Molecules -- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract) -- Grammatical tree matching -- Theoretical and empirical comparisons of approximate string matching algorithms -- Fast and practical approximate string matching -- DZ A text compression algorithm for natural languages -- Multiple alignment with guaranteed error bounds and communication cost -- Two algorithms for the longest common subsequence of three (or more) strings -- Color Set Size problem with applications to string matching -- Computing display conflicts in string and circular string visualization -- Efficient randomized dictionary matching algorithms -- Dynamic dictionary matching with failure functions. |
| Record Nr. | UNISA-996465491703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
A Combinatorial Perspective on Quantum Field Theory [[electronic resource] /] / by Karen Yeats
| A Combinatorial Perspective on Quantum Field Theory [[electronic resource] /] / by Karen Yeats |
| Autore | Yeats Karen |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (IX, 120 p. 16 illus.) |
| Disciplina | 530.14 |
| Collana | SpringerBriefs in Mathematical Physics |
| Soggetto topico |
Quantum field theory
String theory Mathematical physics Discrete mathematics Quantum Field Theories, String Theory Mathematical Physics Discrete Mathematics |
| ISBN | 9783319475516 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Part I Preliminaries -- Introduction -- Quantum field theory set up -- Combinatorial classes and rooted trees -- The Connes-Kreimer Hopf algebra -- Feynman graphs -- Part II Dyson-Schwinger equations -- Introduction to Dyson-Schwinger equations -- Sub-Hopf algebras from Dyson-Schwinger equations -- Tree factorial and leading log toys -- Chord diagram expansions -- Differential equations and the (next-to)m leading log expansion -- Part III Feynman periods -- Feynman integrals and Feynman periods -- Period preserving graph symmetries -- An invariant with these symmetries -- Weight -- The c2 invariant -- Combinatorial aspects of some integration algorithms -- Index. |
| Record Nr. | UNINA-9910155298403321 |
Yeats Karen
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorics and Computer Science [[electronic resource] ] : 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected Papers / / edited by Michel M. Deza, Reinhardt Euler, Ioannis Manoussakis
| Combinatorics and Computer Science [[electronic resource] ] : 8th Franco-Japanese and 4th Franco-Chinese Conference, Brest, France, July 3 - 5, 1995 Selected Papers / / edited by Michel M. Deza, Reinhardt Euler, Ioannis Manoussakis |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 426 p.) |
| Disciplina | 004/.01/5116 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Computers Computer communication systems Combinatorics Numerical analysis Computer programming Discrete Mathematics Theory of Computation Computer Communication Networks Numerical Analysis Programming Techniques |
| ISBN | 3-540-70627-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Equitable and m-bounded coloring of split graphs -- Four coloring for a subset of maximal planar graphs with minimum degree five -- Enumeration algorithm for the edge coloring problem on bipartite graphs -- On-line recognition of interval graphs in O(m+nlog n) time -- Connected proper interval graphs and the guard problem in spiral polygons -- Weighted connected domination and Steiner trees in distance-hereditary graphs -- On central spanning trees of a graph -- Complete bipartite decompositions of crowns, with applications to complete directed graphs -- Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament -- Complementary ?1-graphs and related combinatorial structures -- Double description method revisited -- On skeletons, diameters and volumes of metric polyhedra -- Improving branch and bound for Jobshop scheduling with constraint propagation -- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem -- Ramsey numbers by stochastic algorithms with new heuristics -- On the hybrid neural network model for solving optimization problems -- Constructive — non-constructive approximation and maximum independent set problem -- Weakly greedy algorithm and pair-delta-matroids -- On integer multiflows and metric packings in matroids -- Optimum alphabetic binary trees -- Block codes for dyadic phase shift keying -- Zigzag codes and z-free hulls -- Contiguity orders -- Worst-case analysis for on-line data compression -- Gossiping in cayley graphs by packets -- On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one -- N-cube string matching algorithm with long texts -- Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture -- Some applications of combinatorial optimization in parallel computing -- On the parallel complexity of the alternating Hamiltonian cycle problem -- Threshold graphs and synchronization protocols -- Task assignment in distributed systems using network flow methods -- Distributed rerouting in DCS mesh networks. |
| Record Nr. | UNISA-996465630703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics on Traces [[electronic resource] /] / by Volker Diekert
| Combinatorics on Traces [[electronic resource] /] / by Volker Diekert |
| Autore | Diekert Volker |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XIV, 174 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Mathematical logic Computer logic Computer programming Programming languages (Electronic computers) Theory of Computation Discrete Mathematics Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-46318-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems. |
| Record Nr. | UNISA-996465859703316 |
|
Diekert Volker
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman
| Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (327 pages) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Discrete mathematics
Graph theory Algebraic fields Polynomials Computer science - Mathematics Convex geometry Discrete geometry Discrete Mathematics Graph Theory Field Theory and Polynomials Discrete Mathematics in Computer Science Convex and Discrete Geometry Anàlisi combinatòria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031053757
9783031053740 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ratio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley’s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). |
| Record Nr. | UNISA-996490346803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
