Results 41 to 50 of about 10,268,798 (293)
Towards maximum independent sets on massive graphs [PDF]
Proceedings of the VLDB Endowment, 2015 Maximum independent set (MIS) is a fundamental problem in graph theory and it has important applications in many areas such as social network analysis, graphical information systems and coding theory. The problem is NP-hard, and there has been numerous studies on its approximate solutions.
Yu Liu 0070 +4 more
openaire +3 more sources
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling
ISPRS International Journal of Geo-Information, 2017 Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in a map and for each feature a set of label candidates, a common problem is to select an independent set of ...
Jan-Henrik Haunert, Alexander Wolff
doaj +1 more source
THE NUMBER OF MAXIMUM INDEPENDENT SETS IN GRAPHS
Taiwanese Journal of Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jou, M.J., Chang, G.J.
openaire +3 more sources
IEEE Access, 2020 Radio Frequency IDentification (RFID) systems often encounter reader collisions when multiple readers interrogate tags at the same time. Especially in the mobile RFID system, the mobility of readers leads to more reader collisions.
Zhonghua Li +3 more
doaj +1 more source
Graph Orientations Optimizing the Number of Light or Heavy Vertices
Journal of Graph Algorithms and Applications, 2015 This paper introduces four graph orientation problems named MAXIMIZE W-LIGHT, MINIMIZE W-LIGHT, MAXIMIZE W-HEAVY, and MINIMIZE W-HEAVY, where W can be any fixed non-negative integer. In each problem, the input is an undirected, unweighted graph G and
Yuichi Asahiro +3 more
doaj +1 more source
Graphs with unique maximum independent sets
Discrete Mathematics, 1985 A graph is a unique independence graph if it has a unique independent set of vertices of maximal cardinality. If, moreover, the complement of the set of vertices is also independent, the graph is called a strong unique independence graph. The authors prove the following theorem: A connected graph is a strong unique independence graph if and only if it ...
Glenn Hopkins, William Staton
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The Standards for Psychosocial Care for Children with Cancer and Their Families (“Standards”) are evidence‐based guidelines for psychosocial care in pediatric oncology. Care related to the three “Asking and Monitoring” Standards—Assessment of Psychosocial Needs, Assessment of Financial Needs, and Monitoring Neurocognitive Problems ...
Julia B. Tager +8 more
wiley +1 more source
Algorithms for the Maximum Independent Set Problem [PDF]
, 2015 This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph
Lê, Ngoc C.
core +3 more sources
Data aggregation scheduling algorithm based on twice maximum independent set
Tongxin xuebao, 2014 The main task in designing a data aggregation schedule was to get a good trade-off between QoS and weighted fairness guarantee.In order to address this problem,a novel data aggregation scheduling algorithm,MISS,was proposed,which could produce a ...
Jian XU +4 more
doaj +2 more sources
Learning-augmented Maximum Independent Set
CoRRWe study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-δ}$ for any $δ>0$. We show that we can break this barrier in the presence of an oracle obtained through predictions from a ...
Vladimir Braverman +3 more
openaire +4 more sources