X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (6) 6
mathematics (6) 6
mathematics, applied (6) 6
operations research & management science (4) 4
series-parallel graph (4) 4
algorithm (3) 3
computer science, hardware & architecture (3) 3
graphs (3) 3
optimization (3) 3
series–parallel graph (3) 3
theoretical computer science (3) 3
approximation (2) 2
approximation algorithm (2) 2
chordal graphs (2) 2
combinatorics (2) 2
communication-networks (2) 2
complexity (2) 2
computational complexity (2) 2
computer science (2) 2
discrete mathematics and combinatorics (2) 2
generalized flow (2) 2
generalized series-parallel graph (2) 2
generalized steiner problem (2) 2
generalized theta graph (2) 2
heuristic (2) 2
management (2) 2
mathematics - combinatorics (2) 2
mathematics, general (2) 2
models (2) 2
networks (2) 2
physics (2) 2
series-parallel networks (2) 2
subgraph polytopes (2) 2
survivable network (2) 2
05c15 (1) 1
30c15, 82b20 (1) 1
[ info.info-bi ] computer science [cs]/bioinformatics [q-bio.qm] (1) 1
[ info.info-cc ] computer science [cs]/computational complexity [cs.cc] (1) 1
[ info.info-ds ] computer science [cs]/data structures and algorithms [cs.ds] (1) 1
allocation (1) 1
analysis (1) 1
arithmetic (1) 1
astrophysics (1) 1
austausch (1) 1
automation (1) 1
automobiles (1) 1
automotive engineering (1) 1
availability (1) 1
behavior (1) 1
bell's inequalities (1) 1
bell’s inequalities (1) 1
bioinformatics (1) 1
bipartite graphs (1) 1
bounded treewidth (1) 1
buffer and server allocation (1) 1
buffers (1) 1
business and management (1) 1
c (1) 1
chromatic polynomial (1) 1
chromatic roots (1) 1
circuit (1) 1
circular colouring (1) 1
circular ladder (1) 1
circularity (1) 1
cocomparability graphs (1) 1
combinatorial analysis (1) 1
complete bipartite graph (1) 1
completion problem (1) 1
complex networks (1) 1
complexity constraint (1) 1
computation (1) 1
computational theory and mathematics (1) 1
computer programs (1) 1
computer science - data structures and algorithms (1) 1
computer science - discrete mathematics (1) 1
computer science, information systems (1) 1
computer science, interdisciplinary applications (1) 1
computer science, software engineering (1) 1
computer science, theory & methods (1) 1
computer simulation (1) 1
condensed matter - statistical mechanics (1) 1
connectivity constraints (1) 1
constraints (1) 1
containers (1) 1
convex and discrete geometry (1) 1
correlation matrix (1) 1
covariance (1) 1
crapo beta-invariant (1) 1
crcw pram (1) 1
crown graph (1) 1
customers (1) 1
cut (1) 1
data structures and algorithms (1) 1
decomposable graph (1) 1
decomposition tree (1) 1
degree constraint (1) 1
design (1) 1
differential equations (1) 1
directed acyclic graph (1) 1
discrete-time (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Optimization, ISSN 1572-5286, 05/2013, Volume 10, Issue 2, pp. 155 - 162
In the generalized max flow problem, the aim is to find a maximum flow in a generalized network, i.e., a network with multipliers on the arcs that specify... 
Series–parallel graph | Generalized flow | Max flow problem | Integral flow | Series-parallel graph | MATHEMATICS, APPLIED | NETWORK | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMUM FLOW | ALGORITHMS | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2010, Volume 411, Issue 38, pp. 3493 - 3506
Journal Article
BIOINFORMATICS 2018 - 9th International Conference on Bioinformatics Models, Methods and Algorithms, Proceedings; Part of 11th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2018, 2018, Volume 3, pp. 105 - 111
Conference Proceeding
Mathematics in Computer Science, ISSN 1661-8270, 06/2016, Volume 10, Issue 2, pp. 239 - 248
To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s11786-016-0260-6 Given a... 
Generalized theta graph | T-span | Crown graph | Mobius ladder | Series-parallel graph | T-edge span | Wrapped butterfly network | Circular ladder | T-coloring
Journal Article
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2005, Volume 290, Issue 2, pp. 183 - 210
Given an undirected network G = ( V , E ) , a vector of nonnegative integers r = ( r ( v ) : v ∈ V ) associated with the nodes of G and weights on the edges of... 
Polyhedron | Series–parallel graph | Survivable network | Cut | Polynomial algorithm | Series-parallel graph | DESIGN | polyhedron | cut | COMMUNICATION-NETWORKS | survivable network | polynomial algorithm | series-parallel graph | DOMINANT | GRAPHS | MATHEMATICS | TREE POLYTOPE | SERIES-PARALLEL NETWORKS | APPROXIMATION ALGORITHM | CONSTRAINTS | GENERALIZED STEINER PROBLEM | SUBGRAPH POLYTOPES | Algorithms
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2002, Volume 119, Issue 3, pp. 227 - 250
Journal Article
Journal of Information Science and Engineering, ISSN 1016-2364, 05/1999, Volume 15, Issue 3, pp. 407 - 417
Generalized series-parallel (GSP) graphs belong to the class of decomposable graphs which can be represented by their decomposition trees. Given a... 
generalized series-parallel graph | CRCW PRAM | decomposition tree | parallel algorithm | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | decomposable graph
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 11/2001, Volume 83, Issue 2, pp. 272 - 297
The generalized theta graph Θs1, …, sk consists of a pair of endvertices joined by k internally disjoint paths of lengths s1, …, sk⩾1. We prove that the roots... 
complete bipartite graph | Lambert W function | series-parallel graph | chromatic roots | Potts model | generalized theta graph | graph | chromatic polynomial | Generalized theta graph | Graph | Chromatic polynomial | Complete bipartite graph | Series-parallel graph | Chromatic roots | POLYNOMIALS | MATHEMATICS
Journal Article
Networks, ISSN 0028-3045, 12/1997, Volume 30, Issue 4, pp. 293 - 306
The (K, j)‐reliability of a K‐terminal network G is the probability that after the failure of some of its edges the vertices in K will lie in no more than j... 
K ES COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DOMINATION THEORY | SERIES-PARALLEL NETWORKS | ALGORITHM | CRAPO BETA-INVARIANT | GENERALIZED ACTIVITIES | K-TERMINAL RELIABILITY
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2015, Volume 190-191, pp. 86 - 99
We study an extension of the well-known generalized maximum flow problem in which the outflow of an edge is a strictly increasing convex function of its... 
Network flow algorithms | Computational complexity | Maximum flows | Generalized flows | Flow decomposition | MATHEMATICS, APPLIED | GAINS | NETWORKS | Algorithms
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 06/2017, Volume 85, Issue 2, pp. 297 - 335
The partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected... 
graph factors | generalized matching problem | graph packing | P-Partition | Geometry and Topology | graph algorithms | P3‐Partition | Partition | INTERVAL-GRAPHS | PATH PARTITION | P-3-PARTITION | ORIENTATIONS | MATHEMATICS | RECOGNITION ALGORITHM | COMPLEXITY | CHORDAL GRAPHS | BIPARTITE GRAPHS | Bioinformatics | Data Structures and Algorithms | Computer Science | Computational Complexity
Journal Article
Entropy, ISSN 1099-4300, 06/2013, Volume 15, Issue 6, pp. 2448 - 2463
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 4/2017, Volume 33, Issue 3, pp. 897 - 923
Journal Article
Networks, ISSN 0028-3045, 08/2015, Volume 66, Issue 1, pp. 33 - 39
Journal Article
2013, 1, Wiley Series in Bioinformatics, ISBN 1118345789, Volume 22, 17
The authors in this chapter develop a computationally much more efficient approach based on homomorphisms and homeomorphisms, allowing toleration of the... 
network alignment algorithm | generalized dynamic programming algorithm | bounded treewidth | generalized network alignment | metabolic network alignment
Book Chapter
Chaos: An Interdisciplinary Journal of Nonlinear Science, ISSN 1054-1500, 07/2017, Volume 27, Issue 7, p. 073113
In this paper, we show that novel autonomous chaotic oscillators based on one or two bipolar junction transistors and a limited number of passive components... 
MATHEMATICS, APPLIED | GENERALIZED SYNCHRONIZATION | BEHAVIOR | TIME-SERIES | IMPLEMENTATION | SYSTEMS | PHYSICS, MATHEMATICAL | COMPLEX NETWORKS | CIRCUIT
Journal Article
OPSEARCH, ISSN 0030-3887, 3/2019, Volume 56, Issue 1, pp. 123 - 150
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.