Výsledky vyhľadávania - Graph Theory—graph algorithms General Terms
-
1
Lovász-Type Theorems and Game Comonads
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… As special cases of this general theorem, we obtain two variants of Lovász' theorem: the result by Dvořák (2010) that characterises equivalence of graphs in the k…”
Získať plný text
Konferenčný príspevok.. -
2
Connectivity in resources for teaching graph theory in engineering education
ISSN: 1863-9690, 1863-9704Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2024Vydané v ZDM (01.12.2024)“…This contribution explores the teaching of graph theory in the context of engineering education…”
Získať plný text
Journal Article -
3
Discovering large conserved functional components in global network alignment by graph matching
ISSN: 1471-2164, 1471-2164Vydavateľské údaje: London BioMed Central 24.09.2018Vydané v BMC genomics (24.09.2018)“… However, finding large conserved components remains challenging due to its NP-hardness. Results We propose a new graph matching method GMAlign for global PPI network alignment…”
Získať plný text
Journal Article -
4
Dinkelbach NCUT: An Efficient Framework for Solving Normalized Cuts Problems with Priors and Convex Constraints
ISSN: 0920-5691, 1573-1405Vydavateľské údaje: Boston Springer US 01.08.2010Vydané v International journal of computer vision (01.08.2010)“…) problem under general, convex constraints, as well as, under given priors on the nodes of the graph…”
Získať plný text
Journal Article -
5
Knowledge Graphs and Big Data Processing
ISBN: 3030531996, 9783030531997, 9783030531980, 3030531988Vydavateľské údaje: Cham Springer Nature 2020“… The term data analytics is often used interchangeably with intelligence, statistics, reasoning, data mining, knowledge discovery, and others…”
Získať plný text
E-kniha Kniha -
6
Finite‐horizon bounded H∞ synchronisation and state estimation for discrete‐time complex networks: local performance analysis
ISSN: 1751-8644, 1751-8652Vydavateľské údaje: The Institution of Engineering and Technology 14.04.2017Vydané v IET control theory & applications (14.04.2017)“… In addition, a more general sector‐bounded condition is presented, where the parameter matrices are different for different node…”
Získať plný text
Journal Article -
7
Complexity of generalized colourings of chordal graphs
ISBN: 9780494468265, 0494468262Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2008“…The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1,…, Pk…”
Získať plný text
Dissertation -
8
Network reliability : measures and evaluation
ISBN: 1119223563, 9781119223566, 9781119224037, 1119224039Vydavateľské údaje: Salem, Mass Wiley 2016“…In Engineering theory and applications, we think and operate in terms of logics and models with some acceptable and reasonable assumptions…”
Získať plný text
E-kniha Kniha -
9
Jewels of stringology
ISBN: 9789810247829, 9810247826Vydavateľské údaje: New Jersey ; Singapore World Scientific 2002“…The term "stringology" is a popular nickname for text algorithms, or algorithms on strings…”
Získať plný text
E-kniha Kniha -
10
Signal flow graphs-Computer-aided system analysis and sensitivity calculations
ISSN: 0098-4094Vydavateľské údaje: IEEE 01.03.1974Vydané v IEEE transactions on circuits and systems (01.03.1974)“…Concepts which promise to extend many fundamental results of network theory to general systems are introduced…”
Získať plný text
Journal Article -
11
Finite-horizon bounded $H_{\infty }$ H ∞ synchronisation and state estimation for discrete-time complex networks: local performance analysis
ISSN: 1751-8644, 1751-8652Vydavateľské údaje: The Institution of Engineering and Technology 14.04.2017Vydané v IET control theory & applications (14.04.2017)“… In addition, a more general sector-bounded condition is presented, where the parameter matrices are different for different node…”
Získať plný text
Journal Article -
12
An exponentially fitted tridiagonal finite difference method for singularly perturbed differential-difference equations with small shift
ISSN: 2090-4479Vydavateľské údaje: Elsevier BV 01.12.2014Vydané v Ain Shams Engineering Journal (01.12.2014)Získať plný text
Journal Article -
13
Generalized and modified ant algorithm for solving robot path planning problem
ISBN: 9781424455379, 1424455375Vydavateľské údaje: IEEE 01.07.2010Vydané v 2010 3rd IEEE International Conference on Computer Science and Information Technology (01.07.2010)“… As per the general theory of the graph search algorithms, the increase in the number of neighborhood points make the solutions more optimal in terms…”
Získať plný text
Konferenčný príspevok..

