Results 1 to 10 of about 51,828 (72)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph.
Hanna Furmańczyk, Vahan Mkrtchyan
+7 more sources
Visualising the structure of document search results: A comparison of graph theoretic approaches [PDF]
, 2009 This is the post-print of the article - Copyright @ 2010 Sage PublicationsPrevious work has shown that distance-similarity visualisation or ‘spatialisation’ can provide a potentially useful context in which to browse the results of a query search ...
Busing F. +7 more
core +1 more source
Efficient computation of the Shapley value for game-theoretic network centrality [PDF]
, 2013 The Shapley value—probably the most important normative payoff division scheme in coalitional games—has recently been advocated as a useful measure of centrality in networks.
Aaditha, K. V. +4 more
core +3 more sources
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Hardness and Algorithms for Rainbow Connectivity [PDF]
, 2009 An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G
Chakraborty, Sourav +3 more
core +4 more sources
An Efficient Algorithm for Clustering of Large-Scale Mass Spectrometry Data
, 2013 High-throughput spectrometers are capable of producing data sets containing thousands of spectra for a single biological sample. These data sets contain a substantial amount of redundancy from peptides that may get selected multiple times in a LC-MS/MS ...
Hoffert, Jason D. +3 more
core +1 more source
Game theoretic controller synthesis for multi-robot motion planning Part I : Trajectory based algorithms [PDF]
, 2014 We consider a class of multi-robot motion planning problems where each robot is associated with multiple objectives and decoupled task specifications. The problems are formulated as an open-loop non-cooperative differential game.
Chaudhari, Pratik +3 more
core +1 more source
A semidefinite program for unbalanced multisection in the stochastic block model
, 2016 We propose a semidefinite programming (SDP) algorithm for community detection in the stochastic block model, a popular model for networks with latent community structure.
Perry, Amelia, Wein, Alexander S.
core +1 more source
Streaming Graph Challenge: Stochastic Block Partition
, 2017 An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem.
Gadepally, Vijay +11 more
core +1 more source