Results 161 to 170 of about 47,591 (350)
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
The clique-partitioning problem
, 1991 We study the problem of clique-partitioning a graph. We prove a new general upper bound result on the number of clique-partitions. This upper bound is the best possible, given information of just the vertices and the number of edges.
Samad, Tariq, Bhasker, J.
core +1 more source
Interdiction Models and Heuristics for Graph Propagation
Networks, EarlyView.ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
, 1974 A graph G is clique-critical if G and G−x have different clique-graphs for all vertices x of G. For any graph H, there is at most a finite number of different clique-critical graphs G such that H is the clique-graph of G.
Escalante, F, Toft, B
core +1 more source
Nordic Journal of Botany, EarlyView.The Irano‐Turanian Floristic Region harbors a rich flora, but our understanding of the development of this diversity is limited by a lack of data on phylogenetic relationships and biogeographic patterns of endemic and more widespread plants. Hypotheses of in situ diversification versus allopatric diversification were tested using Iris subgen. Scorpiris,
Mona Salimbahrami +4 more
wiley +1 more source
New Upper Bounds on the Number of Maximum Independent Sets in a Graph
AxiomsAn independent set in a graph comprises vertices that are not adjacent to one another, whereas a clique consists of vertices where all pairs are adjacent.
Vadim E. Levit, Elizabeth J. Itskovich
doaj +1 more source
Clique Partition of Transformation Graphs
, 2016 A clique in a graph G is a complete subgraph of G. A clique partition of G is a collection C of cliques such that each edge of G occurs in exactly one clique in C.
Chandrakala S.B, K.Manjula
core +1 more source
Oikos, EarlyView.Seed dispersal by frugivores is a central process linking plant reproduction, animal foraging, population persistence, and ecosystem resilience. Currently, the spatial template sustaining these interactions is rapidly reconfigured by habitat loss and fragmentation promoted by human activity.
Eliana Cazetta, Paulo R. Guimarães Jr
wiley +1 more source
The Clique Transversal and Clique Independence of Distance Hereditary Graphs
, 2002 A clique-transversal set of a graph G is a subset of vertices intersecting all maximal cliques of G. The smallest possible cardinality τC(G) among all clique transversal sets for G is called clique transversal number.
M. -s. Chang, C. -m. Lee, S. -c. Sheu
core
People and Nature, EarlyView.Abstract Although there have been several initiatives to establish and support participatory processes on large carnivores based on multi‐stakeholder governance at the regional level in Europe, empirical evidence for their evaluation is still lacking. We employed a survey, which was administered to farmers and other stakeholder groups (e.g.
Tasos Hovardas +2 more
wiley +1 more source