X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
graphs (12) 12
algorithms (10) 10
computer science (6) 6
graph theory (6) 6
hypergraphs (6) 6
mathematics (6) 6
mathematics, applied (6) 6
computer science, theory & methods (5) 5
linear algebra (5) 5
linear programming (5) 5
mathematical analysis (5) 5
complexity (4) 4
hypergraph (4) 4
hypertree (4) 4
research (4) 4
computer science, hardware & architecture (3) 3
computer science, software engineering (3) 3
eigen values (3) 3
linear hypergraph (3) 3
linear-time algorithm (3) 3
linear-time algorithms (3) 3
matrix (3) 3
trees (3) 3
acyclicity (2) 2
analysis (2) 2
apexes (2) 2
approximation (2) 2
article subject (2) 2
bipartite tree (2) 2
categories (2) 2
clique-width (2) 2
combinatorics (2) 2
computer science - data structures and algorithms (2) 2
computer science, information systems (2) 2
connected domination (2) 2
constraint satisfaction problems (2) 2
database schemes (2) 2
decision trees (2) 2
domination (2) 2
duality (2) 2
enumeration (2) 2
hypertree decompositions (2) 2
life sciences, general (2) 2
linear equations (2) 2
matrices (2) 2
multidisciplinary sciences (2) 2
networks (2) 2
operations research & management science (2) 2
parameter optimization (2) 2
polya's enumeration theorem (2) 2
polynomials (2) 2
pólya's enumeration theorem (2) 2
research article (2) 2
spectra (2) 2
steiner tree (2) 2
steiner trees (2) 2
strongly chordal graphs (2) 2
studies (2) 2
theory of computation (2) 2
tree structure (2) 2
tree-width (2) 2
unions (2) 2
05c05 (1) 1
05c15 (1) 1
05c65 (1) 1
05c81 (1) 1
05c85 (1) 1
60j80 (1) 1
65c05 (1) 1
[ info.info-db ] computer science [cs]/databases [cs.db] (1) 1
acyclic hypergraph (1) 1
algorithm (1) 1
arc cutting (1) 1
artificial intelligence (1) 1
auctions (1) 1
balanced matrix (1) 1
binomials (1) 1
biologie (1) 1
bipartite (1) 1
bipartite incidence graphs (1) 1
bonferroni-type inequalities (1) 1
boolean-formulas (1) 1
bounded treewidth (1) 1
branch-width (1) 1
bridged graphs (1) 1
business and management, general (1) 1
caterpillars (1) 1
centers (1) 1
chemistry/food science, general (1) 1
chordal bipartite graph (1) 1
chordal graphs (1) 1
chordality of line graphs (1) 1
chromatic polynomial (1) 1
chromatic uniqueness (1) 1
clique graphs (1) 1
clique hypergraphs (1) 1
clustering (1) 1
collection (1) 1
color (1) 1
coloring (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Linear Algebra and its Applications, ISSN 0024-3795, 12/2018, Volume 558, p. 236
We determine the unique hypertrees with maximum spectral radius among k-uniform non-hyper-caterpillars with m edges and diameter d for 4 ≤ d ≤ m -2, among... 
Matrix | Vector space | Apexes | Linear algebra | Caterpillars | Graph theory | Number theory
Journal Article
TheScientificWorldJournal, ISSN 2356-6140, 2014, Volume 2014, pp. 637865 - 7
For a simple hypergraph H on n vertices, its Estrada index is defined as EE(H) = Sigma(n)(i=1) e(lambda i), where lambda(1), lambda(2), ... , lambda(n) are the... 
PROTEINS | FOLDING DEGREE | UNICYCLIC GRAPHS | MULTIDISCIPLINARY SCIENCES | Humans | Mathematics | Models, Statistical | Linear systems | Trees (Graph theory) | Research | Mathematical research | Science | Graphs
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 186 - 192
A hypergraph is equitably k-colorable if its vertices can be partitioned into k sets/color classes in such a way that monochromatic edges are avoided and the... 
Hypergraph | Feasible sequence | Linear hypertree | Equitable coloring | MATHEMATICS, APPLIED | GRAPHS | Analysis | Algorithms | Coloring | Apexes | Color | Graphs | Graph theory | Polynomials | Dynamic programming
Journal Article
The Computer Journal, ISSN 0010-4620, 5/2008, Volume 51, Issue 3, pp. 326 - 362
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 1998, Volume 82, Issue 1, pp. 43 - 77
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 04/2013, Volume 481, pp. 85 - 99
We show that the Satisfiability (SAT) problem for CNF formulas with β-acyclic hypergraphs can be solved in polynomial time by using a special type of... 
Davis–Putnam resolution | Chordal bipartite graph | Acyclic hypergraph | Davis-Putnam resolution | BIPARTITE | HYPERGRAPHS | COMPLEXITY | CLIQUE-WIDTH | COMPUTER SCIENCE, THEORY & METHODS | LINEAR-TIME ALGORITHMS | HYPERTREE DECOMPOSITIONS | GRAPHS | Hardness | Trucking | Computer Science - Data Structures and Algorithms
Journal Article
Ars Combinatoria, ISSN 0381-7032, 07/2012, Volume 106, pp. 527 - 533
In this note it is shown that the number of cycles of a linear hypergraph is bounded below by its cyclomatic number. 
Cyclomatic number | Hypertree | Linear hypergraph | linear hypergraph | MATHEMATICS | hypertree | cyclomatic number
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 1998, Volume 108, Issue 3, pp. 696 - 709
One of the problems (mainly unsolved) in probabilistic logic is to consistently assign probabilities to logical formulas. In this paper we consider Horn... 
Hypergraph | Integer programming | Probabilistic logic | Balanced matrix | Consistency | hypergraph | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | integer programming | probabilistic logic | balanced matrix | consistency | Linear programming | Probabilities | Research
Journal Article
Ars Combinatoria, ISSN 0381-7032, 01/2006, Volume 78, pp. 225 - 235
A hypergraph is a generalization of an ordinary graph, in which an edge is not limited to contain exactly two vertices, instead, it can contain an arbitrary... 
Hypergraph | Pólya's Enumeration Theorem | Bipartite tree | Hypertree | Linear hypergraph | linear hypergraph | Polya's Enumeration Theorem | MATHEMATICS | hypertree | hypergraph | bipartite tree | ENUMERATION
Journal Article
Chinese Science Bulletin, ISSN 1001-6538, 2/2001, Volume 46, Issue 3, pp. 197 - 199
Journal Article
Linear Algebra and its Applications, ISSN 0024-3795, 09/2017, Volume 529, p. 271
We determine the unique hypergraphs with minimum distance Laplacian spectral radius among connected k-uniform hypergraphs and k-uniform hypertrees,... 
Matrix | Linear algebra | Graph theory | Spectra | Laplace transforms | Eigen values
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2013, Volume 161, Issue 7-8, pp. 1162 - 1167
The hierarchical product of graphs was introduced very recently by L. Barriére et al. in [L. Barriére, F. Comellas, C. Dafló and M. A. Fiol, On the spectra of... 
Edge Szeged index | Revised Szeged index | Szeged index | Hierarchical product | DISTANCE-BALANCED GRAPHS | MATHEMATICS, APPLIED | Graphs | Mathematical analysis | Linear algebra | Spectral lines
Journal Article
Linear Algebra and its Applications, ISSN 0024-3795, 08/2017, Volume 527, p. 32
We prove a result concerning the behavior of the spectral radius of a hypergraph under relocations of edges. We determine the unique hypergraphs with maximum... 
Matrix | Graphs | Spectra | Graph theory | Linear equations | Eigen values
Journal Article
2008 42nd Asilomar Conference on Signals, Systems and Computers, ISSN 1058-6393, 10/2008, pp. 1805 - 1809
In this work a novel approach to the multiple constant multiplication problem, i.e., finding a realization of a number of constant multiplications by using... 
Steiner trees | Energy consumption | Costs | NP-hard problem | Search methods | Hydrogen | Integer linear programming | Finite impulse response filter | Hardware | Delay
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 2008, Volume 399, Issue 3, pp. 236 - 245
Journal Article
Computational Intelligence and Neuroscience, ISSN 1687-5265, 2018, Volume 2018, pp. 2082875 - 9
As a tool of qualitative representation, conditional preference network (CP-net) has recently become a hot research topic in the field of artificial... 
DECOMPOSITION | MODELS | CP-NETS | NEUROSCIENCES | MATHEMATICAL & COMPUTATIONAL BIOLOGY | Problems | Nets | Algorithms | Semantics | Feedback | Decision making | Run time (computers) | Arc cutting | Linear programming | Internet service providers | Preferences | Artificial intelligence
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2000, Volume 98, Issue 3, pp. 191 - 207
For an undirected graph G the kth power G k of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in... 
Perfect elimination ordering | Metric power | LexBFS-ordering | Distance-hereditary graphs | Diameter | Linear-time algorithm | distance-hereditary graphs | MATHEMATICS, APPLIED | diameter | perfect elimination ordering | PERFECT ELIMINATION | metric power | POWERS | linear-time algorithm
Journal Article
Annals of Operations Research, ISSN 0254-5330, 05/2018, pp. 1 - 7
One of the primary objectives of this paper is to generalize Hunter’s bound to m-regular hypergraphs. In particular, new upper and lower bounds for the... 
Probability of union of events | Hunter’s bound | Lower and upper bound | Lower bounds | Linear programming | Graphs | Graph theory
Journal Article
No results were found for your search.

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