ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Computing
Architecture and Urbanism
Research
Literature
Economy
Social Sciences
all records (74)

Languages
English
Spanish
German
Portuguese
French
Finnish

Countries
Indonesia
USA
Brazil
Australia
Ukraine
Italy
Chile
South Africa
Romania
Canada
all records (77)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
11.504  Articles
1 of 1.151 pages  |  10  records  |  more records»
Peer-to-Peer streaming is an effectual and promising way to distribute media content. In a mesh-based system, pull method is the conventional scheduling way. But pull method often suffers from long transmission delay. In this paper, we present a novel sub... see more

We present a weighted approach to compute a maximum cardinality matching in an arbitrary bipartite graph. Our main result is a new algorithm that takes as input a weighted bipartite graph G(A?B,E) with edge weights of 0 or 1. Let w=n be an upper bound on ... see more

Given a graph GG and an odd prime pp, for a mapping f:E(G)?Zp\{0}f: E(G) \to {\mathbb Z}_p\setminus\{0\} and a Zp{\mathbb Z}_p-boundary bb of GG, an orientation t\tau is called an (f,b;p)(f,b;p)-orientation if the net out ff-flow is the same as b(v)b(v) i... see more

A well-known conjecture of Richard Stanley posits that the hh-vector of the independence complex of a matroid is a pure O{\mathcal O}-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is a ... see more

A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling ? : V ? E? 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y)... see more

We study the Hilbert function and the Hilbert series of the vertex cover algebra A(G), where G is a Cohen-Macaulay bipartite graph.

In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of the Boolean lat... see more

Let G be a connected graph with vertex set V(G). The Harary index of a graph is defined as H(G) = ?u ? v 1/d(u, v), where d(u, v) denotes the distance between u and v. In this paper, we determine the extremal graphs with the maximum Harary index among all... see more

We introduce four new elementary short proofs of the famous K\"{o}nig's theorem which characterizes bipartite graphs by absence of odd cycles. Our proofs are more elementary than earlier proofs because they use neither distances nor walks nor spanning tre... see more

1 of 1.151 pages  |  10  records  |  more records»