Skip to main content
    • by 
    •   4  
      EngineeringMathematical SciencesMarkov chainSpanning Tree
    • by 
    •   11  
      Applied MathematicsComputational GeometryPure MathematicsExperimental Study
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower... more
    • by 
    •   5  
      Lower BoundUpper BoundDirected GraphSpanning Tree
    • by 
    •   5  
      Lower BoundUpper BoundDirected GraphSpanning Tree
    • by 
    •   7  
      EngineeringTechnologyComputer NetworksElsevier
    • by 
    •   10  
      Genetic AlgorithmsAgricultureMultidisciplinaryGenetic Algorithm
The reconfiguration of a power distribution system, by exchanging the functional links between its elements, represents one of the most important procedures to improve the performance in the operation of a distribution system. The... more
    • by  and +1
    •   57  
      Electrical EngineeringGeneticsArtificial IntelligencePower Systems
    • by 
    •   14  
      Pure MathematicsFacility LocationDiscrete MathematicsProof
    • by 
    •   8  
      Graph TheoryPure MathematicsChipSpanning Tree
    • by 
    •   5  
      Pure MathematicsAssignment ProblemSpanning TreeDomination number
    • by  and +1
    •   6  
      Optimization ProblemData StructureHamiltonian pathMinimum Spanning Tree
    • by 
    •   8  
      EngineeringAlgorithmNetworkMathematical Sciences
    • by 
    •   9  
      MarketingApplied MathematicsSupply ChainBusiness and Management
    • by 
    •   7  
      AlgorithmSearchConnectivityGraph
The concept of connectivity plays an important role in both theory and applications of fuzzy graphs. Depending on the strength of an arc, this paper classifies arcs of a fuzzy graph into three types namely αα-strong, ββ-strong and... more
    • by 
    •   5  
      EngineeringMathematical SciencesFuzzy GraphSpanning Tree
A spanning tree of a connected graph is a sub graph that is a tree and connects all the vertices together. A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how... more
    • by 
    •   3  
      Cost EstimationSpanning TreeMatrix Multiplication Algorithm
    • by  and +1
    •   2  
      Spanning TreeEdge Coloring
During this time, the method of solving transportation problem was conducted by Northwest-Corner (NWC), Least-Cost (LC), and Vogel’ Approximation (VAM). To achive optimum value, there are several methods, the stepping-stone method,... more
    • by 
    •   4  
      Linear ProgrammingTransportation ProblemSpanning Treebasis tree
    • by 
    •   3  
      Graph TheoryPure MathematicsSpanning Tree
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.
    • by 
    •   6  
      Economic TheoryCost SharingCost AllocationBoolean Satisfiability
    • by 
    •   3  
      Minimum Spanning TreeSpanning TreeFast Algorithm
The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to prevent bridge loops and the broadcast radiation that results from them.
    • by 
    • Spanning Tree
    • by 
    •   3  
      Data AggregationSpanning TreeWireless Sensor Network
    • by 
    •   16  
      Computer ScienceDistributed ComputingRoutingScheduling
The internet of things(IoT) has rapid de-velopment in recent years, so that it is becoming more and more important in our lives. There will be more than billions devices connected to the internet in the near future. How to find the... more
    • by 
    •   5  
      Internet of ThingsWeightService discoveryContext-Aware
    • by 
    •   9  
      Computer ScienceAlgorithmsVisualizationGraph Theory
    • by 
    •   10  
      Mechanical EngineeringApplied MathematicsAlgebraic Graph TheoryNumerical Simulation
Neste artigo é apresentada uma abordagem de cunho técnico e prático para a identificação da funcionalidade e aplicabilidade dos equipamentos de interconexão de redes mais relevantes no status atual da tecnologia (pontes, roteadores e... more
    • by 
    •   12  
      RoutersComputer NetworksInternet Routing ProtocolData Communication and Computer Networks
    • by 
    •   9  
      EngineeringTechnologyComputer NetworksFailure Recovery
    • by 
    •   2  
      Evolutionary AlgorithmSpanning Tree
    • by 
    •   12  
      Computer ScienceCombinatorial OptimizationTraffic EngineeringNetwork optimization
Requirements prioritization is an important activity during requirements collection and management phase of software engineering. Prioritization of small size requirements is not an issue but its importance increases when requirements are... more
    • by 
    •   6  
      Spanning TreeFunctional RequirementsSoftware Requirements PrioritizationCumulative Voting
    • by 
    •   7  
      Applied MathematicsBusiness and ManagementNumerical Analysis and Computational MathematicsBranch-and-cut
    • by 
    •   21  
      Stochastic ProcessStatisticsGraph TheoryPotential Theory
    • by 
    •   5  
      Natural ComputingComputer SoftwareReaction-Diffusion SystemsSpanning Trees
    • by 
    •   3  
      Water SupplySpanning TreeElectrical And Electronic Engineering
    • by 
    •   5  
      AlgorithmsClusteringMobile Ad-hoc Networks (MANETs)Minimum Spanning Tree
This paper examines the optimization of the 64-bit spanning tree carry lookahead adder by sizing the transistors in the different Manchester carry chain blocks and by adjusting the block widths within the carry tree to reduce the critical... more
    • by 
    •   2  
      Circuit DesignSpanning Tree
    • by 
    •   4  
      StatisticsLimit DistributionSpanning TreeMatrix Tree Theorem
    • by 
    •   10  
      Parallel ProcessingMultidisciplinaryData StructureShared memory
Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers... more
    • by 
    •   3  
      Mobile Ad Hoc NetworkComputer ApplicationsSpanning Tree
The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first develop a parallel decomposition algorithm that in polylogarithmic depth and $\otilde(|E|)$ work,... more
    • by 
    •   10  
      Applied MathematicsDistributed ComputingNumerical AnalysisCluster Computing
    • by 
    •   6  
      Distributed ComputingAlgorithmParallel & Distributed ComputingGraph
    • by 
    • Spanning Tree
    • by 
    •   3  
      Applied MathematicsSpanning TreeDiscrete Applied Mathematics
    • by 
    •   19  
      Mechanical EngineeringApplied MathematicsGraph TheoryDistributed System
    • by 
    •   2  
      Dependency ParsingSpanning Tree
    • by 
    •   5  
      Pure MathematicsFuzzy Metric SpaceMinimum Spanning TreeNumerical Analysis and Computational Mathematics
    • by 
    •   12  
      MathematicsApplied MathematicsComputer ScienceGraph Theory
    • by 
    •   4  
      Computational BiologyRandomized AlgorithmGreedy AlgorithmSpanning Tree